ayberkt / Mini-TT
A tiny implementation of dependent types.
☆11Updated 7 years ago
Alternatives and similar repositories for Mini-TT:
Users that are interested in Mini-TT are comparing it to the libraries listed below
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- ☆17Updated 6 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆16Updated 3 weeks ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- ☆18Updated 2 years ago
- ☆23Updated 7 years ago
- Experimental normalisation via scheme☆12Updated 3 years ago
- Type Theory in Type Theory using Cubical Agda☆12Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 3 months ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- Linear map categories in Agda☆5Updated last year
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago