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☆25Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 7 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- Experiments with effect systems☆12Updated 9 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- being the materials from my YOW LambdaJam 2016 talk☆11Updated 9 years ago
- Category theory and algebra☆28Updated 8 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- ☆16Updated 3 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Haskell Type Level Example Programs☆29Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ☆23Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago