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
- 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
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- ☆29Updated 10 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- The language of the future!☆72Updated 2 years ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Updated 4 years ago
- being an experiment with potato power☆23Updated 6 years ago
- ☆21Updated 9 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 last year
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- An enhanced unification algorithm for Coq☆58Updated this week
- Generation of abstract binding trees☆27Updated 4 months ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Constructive Galois connections☆36Updated 7 years ago