meta-logic / sequoia-v0
Design, play with, and analyze sequent calculus proof systems.
☆13Updated 6 months ago
Alternatives and similar repositories for sequoia-v0:
Users that are interested in sequoia-v0 are comparing it to the libraries listed below
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Quasi-quoting library for agda☆17Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆11Updated 4 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆13Updated 7 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- haha I'm graduating☆14Updated 3 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated 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
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- A Coq to Cedille compiler written in Coq☆33Updated 4 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- ☆23Updated 8 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last week
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆15Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- NbE course @ Chalmers☆28Updated 6 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A simple supercompiler formally verified in Agda☆32Updated 8 years ago
- Coq library for handling names☆19Updated 2 years ago