lambdabetaeta / modal-logics
Agda formalisation of dual-context constructive modal logics.
☆20Updated 4 years ago
Alternatives and similar repositories for modal-logics:
Users that are interested in modal-logics are comparing it to the libraries listed below
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- ☆28Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- ☆23Updated 7 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ☆28Updated last year
- ☆17Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 7 years ago
- Compiler backend for generating Scheme code☆27Updated last year
- ☆16Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- ☆18Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 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 8 years ago
- Multimode simple type theory as an Agda library.☆22Updated 4 months ago
- Category theory and algebra☆28Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- ☆47Updated 2 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- 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 2 months ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago