jonsterling / lcf-sequent-calculus-exampleLinks
A self-contained implementation of forward and backward inference for intuitionistic propositional logic
☆18Updated 8 years ago
Alternatives and similar repositories for lcf-sequent-calculus-example
Users that are interested in lcf-sequent-calculus-example are comparing it to the libraries listed below
Sorting:
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Mtac in Agda☆28Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- NbE course @ Chalmers☆28Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ☆23Updated last year
- ☆11Updated 5 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Formalization of Linear Logic☆11Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Quasi-quoting library for agda☆18Updated last year
- Relative Monad Library for Agda☆24Updated 6 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 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
- a version of the 2048 game for Coq☆22Updated 2 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago