Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
☆27Nov 27, 2023Updated 2 years ago
Alternatives and similar repositories for sequents
Users that are interested in sequents are comparing it to the libraries listed below
Sorting:
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- ☆16Feb 18, 2025Updated last year
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 4 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Jan 5, 2015Updated 11 years ago
- ☆21Sep 8, 2021Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- van Laarhoven lenses for Idris☆20Sep 25, 2017Updated 8 years ago
- Effectful Streaming for Idris☆15Dec 13, 2020Updated 5 years ago
- ☆18May 10, 2022Updated 3 years ago
- Formal Topology in Univalent Foundations (WIP).☆37Jul 29, 2022Updated 3 years ago
- A simple Depdently-Typed Language for Research and Learning☆57Aug 20, 2016Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated 11 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- ☆22May 19, 2016Updated 9 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Experiments with modal types☆17Oct 20, 2020Updated 5 years ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Dependently typed programming language written in Haskell☆22Feb 14, 2022Updated 4 years ago
- Stable sort algorithms and their stability proofs in Rocq☆25Dec 10, 2025Updated 3 months ago
- Library of the ##dependent distributed research support group☆120Jul 12, 2024Updated last year
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 4 months ago
- ☆21Apr 15, 2018Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆55Aug 28, 2022Updated 3 years ago
- Implementing grep in Agda☆33Jan 11, 2021Updated 5 years ago