LightAndLight / qttLinks
Quantitative Type Theory implementation
☆54Updated 4 years ago
Alternatives and similar repositories for qtt
Users that are interested in qtt are comparing it to the libraries listed below
Sorting:
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Revised Omega-categorical Typechecker☆27Updated 10 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- ☆48Updated 3 weeks ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Where my everyday research happens☆55Updated 3 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- ☆16Updated 3 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- ICFP tutorial☆39Updated 4 years ago
- ☆21Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year