meta-logic / sequoia-v0Links
Design, play with, and analyze sequent calculus proof systems.
☆13Updated 9 months ago
Alternatives and similar repositories for sequoia-v0
Users that are interested in sequoia-v0 are comparing it to the libraries listed below
Sorting:
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Yet Another deep embedding of Linear Logic in Coq☆16Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆15Updated last month
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last month
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- ☆11Updated 4 years ago
- ☆23Updated 11 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Coq library for handling names☆19Updated 2 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- ☆16Updated 3 years ago
- my phd thesis☆26Updated 10 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- Mtac in Agda☆28Updated 4 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 9 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- Logical relations proof in Agda☆26Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago