jozefg / nbe-for-mlttLinks
Normalization by Evaluation for Martin-Löf Type Theory
☆128Updated 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:
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- SPLV20 course notes☆112Updated 2 years 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
- Library of the ##dependent distributed research support group☆115Updated last year
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- being an operating system for typechecking processes☆128Updated 2 years ago
- Where my everyday research happens☆54Updated last month
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 9 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- A small implementation of higher-order unification☆189Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆48Updated 2 months ago
- A tutorial on how Agda infers things☆59Updated 3 weeks ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Total Parser Combinators in Agda☆131Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated this week
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated last month
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago