jozefg / nbe-for-mltt
Normalization by Evaluation for Martin-Löf Type Theory
☆122Updated 8 months ago
Alternatives and similar repositories for nbe-for-mltt:
Users that are interested in nbe-for-mltt are comparing it to the libraries listed below
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Unification and type inference algorithms☆124Updated 9 years ago
- A prototypical dependently typed languages with sized types and variances☆106Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 7 months ago
- Benchmarks for capture-avoiding substitution☆109Updated this week
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated 4 months ago
- Organization and planning for the Initial Types Club☆72Updated 2 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- A TACtic library for Agda☆48Updated 5 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being an operating system for typechecking processes☆123Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- Library of the ##dependent distributed research support group☆112Updated 7 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆49Updated 6 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆74Updated 3 months ago
- ☆84Updated 7 years ago
- A "implementation" of Girard's paradox in OCaml☆104Updated 9 years ago
- Total Parser Combinators in Agda☆126Updated last year
- SPLV20 course notes☆108Updated 2 years ago
- HoTT in Lean 3☆78Updated 4 years ago
- A tutorial on how Agda infers things☆40Updated 4 years ago
- Programming library for Agda☆126Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago