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 bare-bones LCF-style proof assistant☆24Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Quasi-quoting library for agda☆18Updated 10 months 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
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- 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
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- ☆15Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- NbE course @ Chalmers☆28Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- my phd thesis☆26Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- define ZF Set Theory in Agda and it's model on Ordinal and Ordinal Definable Set☆14Updated 2 months ago
- Mary is the successor of Marx, a content delivery and assessment engine based on markdown and git☆17Updated last year
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- ☆30Updated 2 years ago