jozefg / nbe-for-mlttLinks
Normalization by Evaluation for Martin-Löf Type Theory
☆129Updated last year
Alternatives and similar repositories for nbe-for-mltt
Users that are interested in nbe-for-mltt are comparing it to the libraries listed below
Sorting:
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆120Updated 4 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 months ago
- 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
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- SPLV20 course notes☆113Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- being an operating system for typechecking processes☆130Updated 2 weeks ago
- A tutorial on how Agda infers things☆62Updated 3 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Programming library for Agda☆133Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated 2 months ago
- Total Parser Combinators in Agda☆132Updated 2 months ago
- ☆84Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago