arielsilveira / ModalLibraryLinks
Modal Logic Library in Coq
☆16Updated 3 years ago
Alternatives and similar repositories for ModalLibrary
Users that are interested in ModalLibrary are comparing it to the libraries listed below
Sorting:
- A formalization of continuation-passing style calculi in Coq [WIP]☆37Updated last month
- Programming library for Agda☆130Updated 11 months ago
- ☆86Updated 3 months ago
- Categorical logic from a categorical point of view☆80Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 10 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆103Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 10 months ago
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆167Updated 3 weeks ago
- Compiling Agda code to readable Haskell☆190Updated last week
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- Categorical Logic Notes☆79Updated 3 years ago
- A library of mechanised undecidability proofs in the Coq proof assistant.☆119Updated 3 weeks ago
- The Penn Locally Nameless Metatheory Library☆75Updated 4 months ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- A course on homotopy theory and type theory, taught jointly with Jaka Smrekar☆301Updated last year
- A project of short tutorials and how-to guides for Coq features and Coq Platform packages.☆22Updated last week
- A small implementation of higher-order unification☆189Updated 8 years ago
- Formalization of Linear Logic in Coq☆16Updated 4 months ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- EPIT 2020 - Spring School on Homotopy Type Theory☆107Updated 4 years ago
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 5 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Untitled PL Card Game☆20Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A proof assistant for general type theories☆308Updated this week
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- A tutorial on how Agda infers things☆60Updated last month
- Selected Papers of Dana S. Scott☆162Updated last year
- Formalization of Axiomatic Set Theory in Coq☆19Updated 5 years ago