lambdabetaeta / modal-logicsLinks
Agda formalisation of dual-context constructive modal logics.
☆20Updated 5 years ago
Alternatives and similar repositories for modal-logics
Users that are interested in modal-logics are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆28Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- ☆18Updated 3 years ago
- ☆11Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Multimode simple type theory as an Agda library.☆23Updated 9 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last week
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- what I did on my holidays☆12Updated 6 years ago
- ☆21Updated 3 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
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- ☆16Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- ☆17Updated 3 years ago
- ☆23Updated 11 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- ☆17Updated 6 years ago
- ☆19Updated 3 years ago
- ☆29Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆29Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago