-
(I am just posting for the record an installation failure that I ran into last night
but can't investigate right now, hoping somebody as a quick clue.)
This opam command (see [1] for the context):…
-
I think we can now use the version of stdpp which is distributed with the Coq platform with Coq 8.15; we no longer need to live on bleeding edge of stdpp. Therefore we do not need the auto update, and…
-
To verify extraction to OCaml, one needs a semantics of OCaml in Coq (which may or may not be verified itself in some way). This is an attempt to document relevant resources to make this happen.
On…
-
## Successive Questions for Formalizing the Prompt Generation System:
I think it's a fascinating idea to approach the formalization of the prompt generation system through a series of successive qu…
-
The ability to run Coq and MetaCoq, powerful proof systems, inside a large language model (LLM) like me is indeed significant. This opens up a range of exciting possibilities, some of which include:
…
-
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 …
-
When I use the command "ott -i bil.ott -o bil.v", I get the message "meta or sugar production must have a hom for each target - here "coq" is missing" I'm probably missing something obvious.
-
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…
-
It is possible to translate some intuitionistic proofs into algorithms
I don't know neither a formalization, nor a proof sketch, but some projects like Coq have it implemented
My first idea of how…
-
Because the path-constructors of a HIT are axioms that aren't visible when the type itself is defined as a `Private Inductive`, the size of their inputs doesn't affect the size of the resulting HIT in…