Alternatives and similar repositories for modal-logics:

Users that are interested in modal-logics are comparing it to the libraries listed below

• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 3 months ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated last year
• ericfinster / catt
  Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories
  ☆14Updated 8 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• flupe / generics
  ☆23Updated 10 months ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• laMudri / quantitative
  ☆16Updated 3 years ago
• JorisCeulemans / sikkel
  Multimode simple type theory as an Agda library.
  ☆22Updated 7 months ago
• Deducteam / Agda2Dedukti
  ☆19Updated 3 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 6 months ago
• jespercockx / cubes
  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
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆30Updated 12 years ago
• bobatkey / agda-metric-reals
  ☆29Updated 2 years ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆34Updated 4 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• mikeshulman / dirtt
  Directed type theory for formal category theory
  ☆17Updated 8 years ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆21Updated 3 years ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 12 years ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 2 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆29Updated last year
• limemloh / cubical-congruence
  Congruence Closure Procedure in Cubical Agda
  ☆17Updated 4 years ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆18Updated 6 years ago