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:
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- Mtac in Agda☆28Updated 4 years 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
- ☆29Updated 2 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
- ☆18Updated 3 years ago
- ☆19Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆16Updated 3 years ago
- ☆29Updated 2 years ago
- Multimode simple type theory as an Agda library.☆23Updated 8 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated this week
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- ☆17Updated 2 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- ☆47Updated this week
- ☆15Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆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
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- my phd thesis☆26Updated 9 months ago
- Directed type theory for formal category theory☆17Updated 8 years ago