twanvl / ttieLinks
Type Theory with Indexed Equality
☆26Updated 8 years ago
Alternatives and similar repositories for ttie
Users that are interested in ttie are comparing it to the libraries listed below
Sorting:
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Dependently typed elimination functions using singletons☆28Updated last year
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 5 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 8 months ago
- Experiments with effect systems☆12Updated 9 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- Haskell Type Level Example Programs☆28Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Mtac in Agda☆29Updated 4 years ago
- ☆16Updated 4 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago