jonsterling / lcf-sequent-calculus-example
A self-contained implementation of forward and backward inference for intuitionistic propositional logic
☆18Updated 7 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
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆11Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 weeks ago
- NbE course @ Chalmers☆28Updated 4 months ago
- ☆17Updated 2 years ago
- ☆18Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆27Updated last year
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Mtac in Agda☆28Updated 3 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- ☆11Updated 7 years ago
- Formalization of Linear Logic☆10Updated 7 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- ☆23Updated 6 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 4 months ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year