MetaRocq / rocq-verified-extractionLinks
Verified Extraction from Rocq to OCaml/Malfunction
☆13Updated 6 months ago
Alternatives and similar repositories for rocq-verified-extraction
Users that are interested in rocq-verified-extraction are comparing it to the libraries listed below
Sorting:
- a version of the 2048 game for Coq☆22Updated 2 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆21Updated 6 years ago
- A small Coq library for collecting side conditions and deferring their proof☆25Updated 6 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 6 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A Coq development of the theory of Indexed W types with function extensionality.☆11Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 8 months ago
- Mechanizations of Type Theories☆32Updated 2 weeks ago
- Formalising session types in Coq☆17Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- ☆15Updated 2 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- Research material of Erik Palmgren (1963–2019)☆21Updated 8 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Relation algebra library for Coq☆49Updated last week
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 weeks ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- IO for Gallina☆33Updated 2 weeks ago
- Class instances for Coq inductive types with little boilerplate☆27Updated 7 months ago
- Coq library on rewriting theory and termination☆37Updated last week
- my phd thesis☆26Updated last year
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- GitHub Action using Docker-Coq [maintainers=@Zimmi48]☆15Updated 8 months ago
- Agda to C compiler☆10Updated 2 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- Yet Another deep embedding of Linear Logic in Coq☆16Updated 3 months ago
- ☆45Updated 8 months ago
- A generic goal preprocessing tool for proof automation tactics in Coq☆15Updated 3 months ago