ziman / ittLinks
Tiny dependent calculus with inference of irrelevance and erasure
☆15Updated 5 years ago
Alternatives and similar repositories for itt
Users that are interested in itt are comparing it to the libraries listed below
Sorting:
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- "Programs that explain their effects" talk material☆17Updated 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
- Dependently typed elimination functions using singletons☆28Updated 11 months ago
- System F implemented in Haskell☆24Updated 13 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Control.Effects☆19Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- An Agda formalisation of the theory of directed containers☆12Updated 7 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- Bring fusion to everyone☆14Updated 5 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Mtac in Agda☆28Updated 4 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
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"