meta-logic / sequoia-v0Links
Design, play with, and analyze sequent calculus proof systems.
☆13Updated last year
Alternatives and similar repositories for sequoia-v0
Users that are interested in sequoia-v0 are comparing it to the libraries listed below
Sorting:
- a version of the 2048 game for Coq☆22Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- ☆29Updated 2 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Quasi-quoting library for agda☆18Updated 9 months ago
- Deferring the Details and Deriving Programs☆14Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- The official interpreter for the Jeopardy language☆16Updated 2 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- ☆23Updated last year
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- being a particular fragment of Haskell, extended to a proof system☆34Updated last month
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 weeks ago