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☆27Updated 5 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- ☆11Updated 4 years ago
- Mtac in Agda☆28Updated 3 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 3 weeks ago
- ☆23Updated 9 months ago
- NbE course @ Chalmers☆28Updated 6 months ago
- ☆17Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- ☆18Updated 2 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- ☆16Updated 3 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 7 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
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆29Updated last year
- Quasi-quoting library for agda☆17Updated 4 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago