jozefg / blottLinks
An experimental type checker for a modal dependent type theory.
☆114Updated 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
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- Simplified Observational Type Theory☆84Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- MetaML and MetaOCaml bibliography☆93Updated 8 months ago
- ☆86Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A prototype programming language for programming with runners☆91Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 11 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 3 weeks ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- An enhanced unification algorithm for Coq☆56Updated 4 months ago