bobatkey / sottLinks
Simplified Observational Type Theory
☆83Updated 2 years ago
Alternatives and similar repositories for sott
Users that are interested in sott are comparing it to the libraries listed below
Sorting:
- The Evolution of a Typechecker☆54Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- ☆84Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Where my everyday research happens☆53Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆45Updated 2 weeks ago
- being bits and pieces I'm inclined to leave lying around☆52Updated last week
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- Haskell implementation of nominal datatypes and functions☆43Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- second-order abstract syntax☆31Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago