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
- A prototypical dependently typed languages with sized types and variances☆112Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 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
- A tutorial on how Agda infers things☆63Updated 4 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Library of the ##dependent distributed research support group☆117Updated last year
- SPLV20 course notes☆113Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆99Updated last month
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Strongly-typed System F in Haskell☆119Updated 3 years ago
- being an operating system for typechecking processes☆130Updated last month
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Total Parser Combinators in Agda☆132Updated 3 months ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- Where my everyday research happens☆55Updated last month
- ☆51Updated 2 months ago
- ☆84Updated 8 years ago