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 6 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- ☆11Updated 4 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Mtac in Agda☆28Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Formalization of Linear Logic☆10Updated 7 years ago
- ☆29Updated 2 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 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 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆17Updated 2 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 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
- Relative Monad Library for Agda☆24Updated 5 years ago
- ☆23Updated 10 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- IO using sized types and copatterns☆34Updated 4 years ago