meta-logic / sequoia-v0Links
Design, play with, and analyze sequent calculus proof systems.
☆14Updated 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 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 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
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- ☆30Updated 2 years ago
- NbE course @ Chalmers☆28Updated last year
- Logical relations proof in Agda☆27Updated 10 years ago
- Quasi-quoting library for agda☆18Updated 11 months ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last week
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated last year
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- The official interpreter for the Jeopardy language☆16Updated 2 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- ☆11Updated 5 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year