jyp / sctt
Type-Theory in Sequent Calculus
☆13Updated 9 years ago
Alternatives and similar repositories for sctt:
Users that are interested in sctt are comparing it to the libraries listed below
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.☆11Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Dependently typed elimination functions using singletons☆28Updated 3 months ago
- what I did on my holidays☆12Updated 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'…☆12Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- My master thesis about generic programming and ornaments☆16Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Deciding Presburger arithmetic in agda☆31Updated 2 years ago
- ☆17Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago