ayberkt / Mini-TTLinks
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
Sorting:
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆23Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- ☆17Updated 6 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 8 months ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- System F implemented in Haskell☆24Updated 13 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.