☆26Feb 7, 2017Updated 9 years ago
Alternatives and similar repositories for tog
Users that are interested in tog are comparing it to the libraries listed below
Sorting:
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- ☆32Apr 17, 2023Updated 2 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 11 years ago
- The multimode presheaf proof-assistant☆37Jan 23, 2026Updated last month
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- Yet another haskell term rewriting library☆18Aug 27, 2025Updated 6 months ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory