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
- A bare-bones LCF-style proof assistant☆24Updated 6 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
- 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
- Quasi-quoting library for agda☆18Updated 11 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 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
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Updated last year
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- haha I'm graduating☆14Updated 4 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Coq library for handling names☆19Updated 3 years ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆15Updated 2 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A verified Implementation of a mini prolog☆17Updated 2 years 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
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago