andreasabel / iplLinks
Agda formalization of Intuitionistic Propositional Logic
☆22Updated last month
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
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated 2 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 weeks ago
- ☆11Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 4 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- ☆18Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Quasi-quoting library for agda☆17Updated 7 months 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
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- ☆16Updated 3 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago