Type-Theory in Sequent Calculus
☆14Jul 30, 2015Updated 10 years ago
Alternatives and similar repositories for sctt
Users that are interested in sctt are comparing it to the libraries listed below
Sorting:
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆15Oct 15, 2018Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- what I did on my holidays☆12Jul 9, 2018Updated 7 years ago
- ☆10May 3, 2017Updated 8 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated 2 months ago
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- My PhD thesis, titled "Reasonably Programmable Syntax"☆15Aug 28, 2018Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- ☆18May 10, 2022Updated 3 years ago
- Research material of Erik Palmgren (1963–2019)☆21Apr 7, 2025Updated 10 months ago
- Formal topology (and some probability) in Coq☆31Nov 30, 2018Updated 7 years ago
- Cohesive type theory☆19Dec 6, 2021Updated 4 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- Coherence typechecker for infinity categories☆20Dec 29, 2025Updated 2 months ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- A monadic (and pretty) pretty printer for Haskell☆39Jul 12, 2023Updated 2 years ago