ammkrn / nanoda
A type checker for the Lean theorem prover
☆39Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for nanoda
- Type Theory in Type Theory using Cubical Agda☆12Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- ☆20Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- A dependently typed programming language, and verification tool☆26Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- ☆29Updated 9 years ago
- ☆22Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A simple supercompiler formally verified in Agda☆29Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Updated 2 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆29Updated last year
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 5 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- being an experiment with potato power☆23Updated 4 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- Type theory in type theory☆16Updated 12 years ago