ayberkt / Mini-TTLinks
A tiny implementation of dependent types.
☆11Updated 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:
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 3 weeks ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- ☆23Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 7 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- An attempt to formalize unix cat in fiat☆11Updated 8 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- ☆17Updated 7 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- being an experiment with potato power☆23Updated 6 years ago