-
I've looked through several of the Coq formalizations, and one problem I see is the mixing of modules and idioms from different *overlapping* libraries, such as Coq's Stdlib, Coquelicot, and MathComp …
-
It's quite hard to spot misformalizations when reading the formalization alone.
It would be great if the $$\LaTeX$$ description could be included in a docstring (`/-- doc -/` in lean, I can't speak f…
-
**Project name:** Coq Library of Complexity proofs
**Initial author(s):** Fabian Kunze, Lennard Gäher, Maxi Wuttke, Yannick Forster
**Current URL:** https://github.com/uds-psl/coq-library-comple…
-
I'd be glad to provide a response that incorporates the best aspects of Response A and Response B, addresses their shortcomings, and adheres to the task instructions:
While the concepts presented in …
-
Hello,
I am currently building a translation from Cryptol to Coq, and Jennifer Paikin mentioned hs-to-coq. Like in your project, we have developed a tiny Coq AST and pretty-printer. It saddens me a…
-
- 29/4
- [ ] Read (stainless paper)[http://lara.epfl.ch/~kuncak/papers/HamzaETAL19SystemFR.pdf] to understand
- [ ] what does it mean for two types to be equal (Niki suspects equality is up…
-
In order to prove that V as defined in Exercise 10.11 admits the constructor (ii) of Definition 10.5.1 (which in the Coq formalization is called `setext'`), we let `R : A -> B -> Prop` be `fun a b => …
-
## Move a project to coq-community ##
**Project name:** NuprlInCoq
**Initial author(s):** Vincent Rahli, Abhishek Anand, and Mark Bickford
**Current URL:** https://github.com/vrahli/NuprlInCo…
-
[Coq Library of Undecidability Proofs](https://github.com/uds-psl/coq-library-undecidability) is a collection of definitions and results related to computability, not least the halting problem. For ex…
-
**Project name:** Polaris
**Initial author(s):** Joseph Tassarotti
**Current URL:** https://github.com/jtassarotti/polaris
**Kind:** pure Coq library
**License:** BSD
**Description:** L…