andreasabel / iplLinks
Agda formalization of Intuitionistic Propositional Logic
☆22Updated 3 months ago
Alternatives and similar repositories for ipl
Users that are interested in ipl are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆28Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆18Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- ☆16Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 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 9 years ago
- ☆17Updated 6 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- ☆11Updated 5 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Multimode simple type theory as an Agda library.☆23Updated last year
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago