lambdabetaeta / modal-logicsView external linksLinks
Agda formalisation of dual-context constructive modal logics.
☆20Apr 1, 2020Updated 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:
- ☆21Sep 8, 2021Updated 4 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- ☆29Jun 23, 2022Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Apr 29, 2023Updated 2 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- Formalization of 2LTT in Agda☆17Aug 6, 2025Updated 6 months ago
- ☆18May 10, 2022Updated 3 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- ☆16Dec 28, 2021Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A formalization of category theory in cubical Agda☆59May 24, 2020Updated 5 years ago
- An Agda library for programming with ternary relations☆18Apr 9, 2025Updated 10 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- The multimode presheaf proof-assistant☆37Jan 23, 2026Updated 3 weeks ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- Haskell implementation of nominal datatypes and functions☆44Aug 4, 2020Updated 5 years ago
- ☆45Jun 20, 2019Updated 6 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Feb 21, 2020Updated 5 years ago
- ☆12May 22, 2016Updated 9 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Jun 16, 2024Updated last year
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- An Agda formalisation of the theory of directed containers☆12Apr 25, 2025Updated 9 months ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Jan 14, 2019Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- The theory of algebraic graphs formalised in Agda☆91Jul 15, 2018Updated 7 years ago