MetaRocq / rocq-verified-extraction
☆13Updated last week
Alternatives and similar repositories for rocq-verified-extraction:
Users that are interested in rocq-verified-extraction are comparing it to the libraries listed below
- 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
- Mechanizations of Type Theories☆28Updated last month
- Relation algebra library for Coq☆48Updated 3 weeks ago
- a version of the 2048 game for Coq☆22Updated last year
- A reflection-based proof tactic for lattices in Coq☆21Updated last year
- A Coq development of the theory of Indexed W types with function extensionality.☆11Updated 7 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Class instances for Coq inductive types with little boilerplate☆24Updated last week
- IO for Gallina☆32Updated last month
- ☆15Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- ☆23Updated 9 months ago
- A generic goal preprocessing tool for proof automation tactics in Coq☆16Updated 4 months ago
- ☆11Updated 4 years ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 6 months ago
- ☆17Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Coq library for handling names☆19Updated 2 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Agda to C compiler☆10Updated last year
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated 2 weeks ago
- ☆29Updated 2 years ago
- my phd thesis☆26Updated 8 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 5 years ago
- Micromega tactics for Mathematical Components☆25Updated 4 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆17Updated 2 weeks ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Verified NbE via gluing in Agda☆11Updated 11 months ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆12Updated 2 years ago