ammkrn / nanodaLinks
A type checker for the Lean theorem prover
☆41Updated 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☆26Updated 9 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Type Theory in Type Theory using Cubical Agda☆13Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆21Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- ☆22Updated 9 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 2 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 6 months ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 5 years ago
- Type theory in type theory☆16Updated 13 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 6 months ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Higher Algebra with Opetopic Types☆15Updated 2 years ago
- Formalization of type theory☆22Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- ☆29Updated 9 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year