ayberkt / Mini-TT
A tiny implementation of dependent types.
☆11Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for Mini-TT
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 4 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- ☆23Updated 7 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- ☆17Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 weeks ago
- Agda suffices: software written from A to Z in Agda☆15Updated 5 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- ☆16Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- being an experiment with potato power☆23Updated 4 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- "Programs that explain their effects" talk material☆17Updated 6 years ago