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:
- ☆21Updated 7 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- A simple implementation of linear type theory☆38Updated 8 years ago
- A dependently typed programming language, and verification tool☆27Updated 9 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆101Updated 3 years ago
- ☆21Updated 9 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 9 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- being an experiment with potato power☆23Updated 6 years ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- A dependent type theory with user defined data types☆47Updated 4 years ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- The language of the future!☆73Updated 2 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Type theory in type theory☆16Updated 13 years ago
- Command-like expressions for real infinite-precision calculations☆55Updated 5 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Constructive Galois connections☆36Updated 7 years ago