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
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Mtac in Agda☆28Updated 3 years ago
- ☆11Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Agda code for experimenting with internal models of cubical type theory☆13Updated 7 years ago
- ☆18Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Multimode simple type theory as an Agda library.☆22Updated 6 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- ☆18Updated 3 years ago
- ☆29Updated 2 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 4 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 weeks ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ☆17Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- my phd thesis☆26Updated 7 months ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆16Updated 3 years ago