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:
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 7 months ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- my phd thesis☆26Updated 11 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week
- ☆18Updated 3 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 4 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- IO using sized types and copatterns☆35Updated 4 years ago
- ☆12Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- ☆11Updated 5 years ago
- ☆23Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆21Updated 3 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- Higher Algebra with Opetopic Types☆15Updated 2 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- Mtac in Agda☆28Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆27Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago