arielsilveira / ModalLibraryLinks
Modal Logic Library in Coq
☆15Updated 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]☆36Updated last week
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 4 years ago
- Material para Matemática Discreta☆10Updated 8 years ago
- Calculus of Constructions☆17Updated 5 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated 3 months ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆166Updated last month
- Simplified Observational Type Theory☆83Updated 2 years ago
- ☆10Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Class instances for Coq inductive types with little boilerplate☆24Updated 2 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- ☆86Updated 2 months ago
- annotations and solutions for the book Category Theory for Programmers by Bartosz Milewski☆19Updated 5 years ago
- Formalization of Linear Logic in Coq☆16Updated 2 months ago
- Porting of software foundations book to Agda☆38Updated 11 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 2 months ago
- Haskell implementation of nominal datatypes and functions☆43Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- Minimal, fast, robust implementation of the Calculus of Constructions on JavaScript.☆113Updated 8 years ago
- Programming library for Agda☆129Updated 10 months ago
- A declarative toy language inspired on set comprehensions.☆18Updated 6 years ago
- A minimal proof language.☆206Updated 6 years ago
- A project of short tutorials and how-to guides for Coq features and Coq Platform packages.☆21Updated 2 weeks ago
- A library of mechanised undecidability proofs in the Coq proof assistant.☆119Updated 2 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago