ayberkt / sequentsLinks
Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
☆26Updated 2 years ago
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☆24Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Quasi-quoting library for agda☆18Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Mtac in Agda☆29Updated 4 years ago
- my phd thesis☆26Updated last year
- ☆23Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- ☆17Updated 3 years ago
- https://metaborg.github.io/mj.agda/☆13Updated 5 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated 2 years ago
- ☆31Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated 2 years ago
- ☆11Updated 5 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
- ☆19Updated 2 months ago
- ☆18Updated 3 years ago
- A library for doing generic programming in Agda☆36Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year