jyp / scttLinks
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
Sorting:
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 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
- Domain theory and denotational semantics in Coq☆10Updated 10 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
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 6 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year