jozefg / blottLinks
An experimental type checker for a modal dependent type theory.
☆112Updated 5 years ago
Alternatives and similar repositories for blott
Users that are interested in blott are comparing it to the libraries listed below
Sorting:
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- MetaML and MetaOCaml bibliography☆94Updated 7 months ago
- ☆84Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Implementation of Nuprl's type theory in Coq☆45Updated 7 months ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- A prototype programming language for programming with runners☆90Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago