jonsterling / lcf-sequent-calculus-exampleLinks
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
Sorting:
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Mtac in Agda☆28Updated 4 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- ☆16Updated 3 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- ☆11Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Benchmarking tool for compile-time performance of Agda programs☆19Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆34Updated last month
- 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
- ☆17Updated 3 years ago
- ☆29Updated 2 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago