andreasabel / ipl
Agda formalization of Intuitionistic Propositional Logic
☆22Updated last year
Alternatives and similar repositories for ipl:
Users that are interested in ipl are comparing it to the libraries listed below
- Formalizing nbe in agda☆30Updated 12 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 weeks ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- Mtac in Agda☆28Updated 3 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ☆17Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- ☆11Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- ☆16Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆18Updated 2 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Multimode simple type theory as an Agda library.☆22Updated 4 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Compiler backend for generating Scheme code☆26Updated last year