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 dependently typed programming language, and verification tool☆26Updated 9 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆29Updated 9 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last week
- Experimental type-checker for internally parametric type theory☆32Updated 4 months ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- being an experiment with potato power☆23Updated 5 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- ☆22Updated 9 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- Type theory in type theory☆16Updated 13 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- ☆16Updated 6 months ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Reference type checker for the Lean theorem prover☆62Updated 8 years ago