jozefg / blottLinks
An experimental type checker for a modal dependent type theory.
☆116Updated 5 years ago
Alternatives and similar repositories for blott
Users that are interested in blott are comparing it to the libraries listed below
Sorting:
- Normalization by Evaluation for Martin-Löf Type Theory☆131Updated last year
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Simplified Observational Type Theory☆86Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 5 months ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An enhanced unification algorithm for Coq☆58Updated last month
- An interactive theorem prover based on lambda-tree syntax☆98Updated last month
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- A prototype programming language for programming with runners☆92Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 4 months ago
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- ☆85Updated 8 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Updated 4 years ago