ayberkt / sequentsLinks
Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
☆26Updated last year
Alternatives and similar repositories for sequents
Users that are interested in sequents are comparing it to the libraries listed below
Sorting:
- Correctness of normalization-by-evaluation for STLC☆23Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Mtac in Agda☆28Updated 4 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Quasi-quoting library for agda☆18Updated 10 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- Logical relations proof in Agda☆27Updated 10 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 9 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- Category theory and algebra☆27Updated 9 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- my phd thesis☆26Updated last year
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- ☆17Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ☆18Updated 3 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- https://metaborg.github.io/mj.agda/☆13Updated 4 years ago
- ☆11Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 weeks ago
- ☆21Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago