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:
- A usable type system for call by push-value☆33Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- ICFP tutorial☆39Updated 4 years ago
- ☆16Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- ☆51Updated 4 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Paper and talk☆55Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆84Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Where my everyday research happens☆55Updated last month
- Revised Omega-categorical Typechecker☆27Updated last year
- Formalizing nbe in agda☆32Updated 13 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Some tools for provability logic☆37Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago