kino3 / Mini-TTLinks
mirror of A simple type-theoretic language: Mini-TT
☆39Updated 8 years ago
Alternatives and similar repositories for Mini-TT
Users that are interested in Mini-TT are comparing it to the libraries listed below
Sorting:
- ☆36Updated 3 years ago
- An enhanced unification algorithm for Coq☆56Updated 2 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Implementation for ICFP 2020 paper☆53Updated 3 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆45Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆13Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Verified C programming in Agda☆16Updated 4 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated last year
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 9 months ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 2 months ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 4 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- my phd thesis☆26Updated 10 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆75Updated 7 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- ☆29Updated 2 years ago
- ☆47Updated 3 weeks ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 6 months ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago