jozefg / nbe-for-mlttLinks
Normalization by Evaluation for Martin-Löf Type Theory
☆131Updated 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.☆116Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 2 weeks ago
- Benchmarks for capture-avoiding substitution☆121Updated 8 months ago
- SPLV20 course notes☆114Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 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
- being an operating system for typechecking processes☆130Updated 3 months ago
- A tutorial on how Agda infers things☆63Updated 6 months ago
- Simplified Observational Type Theory☆87Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last week
- ☆52Updated 5 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 5 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- A core language and API for dependently typed languages☆97Updated 11 months ago
- Library of the ##dependent distributed research support group☆118Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Updated last year
- A TACtic library for Agda☆51Updated last year
- being the materials for a paper I have in mind to write about the bidirectional discipline☆54Updated 6 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Where my everyday research happens☆55Updated this week
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Total Parser Combinators in Agda☆133Updated 5 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year