ammkrn / nanodaLinks
A type checker for the Lean theorem prover
☆40Updated 4 years ago
Alternatives and similar repositories for nanoda
Users that are interested in nanoda are comparing it to the libraries listed below
Sorting:
- A dependently typed programming language, and verification tool☆27Updated 9 years ago
- ☆21Updated 7 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆99Updated 3 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Updated 3 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- ☆16Updated 8 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Command-like expressions for real infinite-precision calculations☆54Updated 2 months ago
- being an experiment with potato power☆23Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- ☆22Updated 9 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- ☆29Updated 10 years ago