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 library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 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
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- ☆15Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Quasi-quoting library for agda☆18Updated last year
- Deferring the Details and Deriving Programs☆14Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Coq library for handling names☆19Updated 3 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Interpreter for functional pure type systems.☆21Updated 8 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 4 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Updated 7 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 weeks ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- define ZF Set Theory in Agda and it's model on Ordinal and Ordinal Definable Set☆14Updated last month
- ☆31Updated 2 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year