Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic
☆45May 14, 2016Updated 9 years ago
Alternatives and similar repositories for coq-sequent-calculus
Users that are interested in coq-sequent-calculus are comparing it to the libraries listed below
Sorting:
- ☆17Oct 16, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- A reflection-based proof tactic for lattices in Coq☆21Oct 15, 2023Updated 2 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Formal topology (and some probability) in Coq☆31Nov 30, 2018Updated 7 years ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Apr 23, 2021Updated 4 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Lenses in Coq☆17Oct 7, 2022Updated 3 years ago
- A framework for extensible, reflective decision procedures.☆19Nov 25, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Implementation of sprintf for Coq☆19Apr 6, 2020Updated 5 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- Implementation of a language interpreter in the browser, using js_of_ocaml.☆15Dec 25, 2017Updated 8 years ago
- Finite sets, finite maps, multisets and generic sets☆51Updated this week
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Jul 24, 2019Updated 6 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated this week
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago