-
> If you have an array of length N. Its keys could be represented by the range 0..N where the upper limit is non-inclusive. If you have a range 0..N-1 it's trivial to show that this range is fully c…
-
hi fystyles, I am very grateful for the qr code scanner that you have created. I want to ask what are your steps to make a qr code scanner, what are the theories and steps that need to be considered…
-
Use polymorphism to encode different combinations of theories.
```
// 1.
SharedActiveSpaceSolver solver = build_active_space_solver(options.get_str("CAS_TYPE"));
solver->compute_energy(…
-
As discussed, it would be nice to tag operators and axioms in certain abstract theories as non-instantiable. For `Subtype`, this could look as follows:
```
type T.
pred P : T.
axiom P_nonempty…
chdoc updated
4 months ago
-
Some users have reported that when they tried to type a university name after they logged into the app for the first time, no university names were listed below. But if you refresh the page, the unive…
-
It would be *very* useful if one could use Z3 or another SMT solver to automatically dismiss proof obligations for obvious statements. There is already such an integration with Agda: Schmitty (https:/…
-
https://github.com/affeldt-aist/trajectories/blob/d7eddd45c917c1d7e628d901bd494dd2253763a5/theories/ssr_descartes/bern5.v#L88
Coq complains because `iter_nat` is a notation.
Indeed, replacing `ite…
-
As discussed in #12847 we should document the registerable constants. Currently the only way to know if something can be registered is by reading the source code.
cc @herbelin
-
From what I understand, the current theory formalised here includes pi-types, base types (`U₀`) and something that looks a bit like large elimination (`El₀`). As far as I can tell though, the only rea…
-
#### Description of the problem
I'm trying to build Coq for Void Linux, the i686 target. It fails with errors like
```
File "theories/dune", line 1807, characters 1-778:
1807 | (rule
1808 | …