jonsterling / lcf-sequent-calculus-example
A self-contained implementation of forward and backward inference for intuitionistic propositional logic
☆18Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for lcf-sequent-calculus-example
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- ☆11Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 11 months ago
- ☆27Updated last year
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- NbE course @ Chalmers☆28Updated last month
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- ☆17Updated 2 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆18Updated 2 years ago
- Mtac in Agda☆28Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- ☆21Updated 4 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆21Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago