-
It has been advertised to never close proofs with `Qed`, and to opacify with `Opaque` afterwards instead.
It has also been pointed out that those two options are not equivalent. With @amblafont , we …
-
Support nodes *with memory*, or *starred* nodes.
As already discussed over the phone, we have an open discussion to understand how nodes with memory shall be specified in COQ:
* As @miccol pointed…
-
Append one comment to this issue for each meeting.
-
There are nice purely geometrical proofs for Morley's theorem that may become possible with the development of elementary geometry from Tarski's axioms.
tirix updated
4 years ago
-
``` coq
(* File reduced by coq-bug-finder from original input, then from 8249 lines to 907 lines, then from 843 lines to 357 lines, then from\
351 lines to 260 lines, then from 208 lines to 162 lines…
-
Yesterday I watched [the video](https://www.youtube.com/watch?v=Dp-mQ3HxgDE) by Prof Buzzard about [Lean](https://leanprover.github.io/) and there was a question of how it compares to Coq (obviously),…
-
VV: " Basics do not require type-in-type and maybe we can make it clear even with the existing Coq."
I'll see if I can set this up in the Makefile.
-
Now that we have tensor products of abelian groups in #2021, a nice exercise (and something useful for calculations) would be to show that
$$\mathbb{Z}/a\mathbb{Z} \otimes_{\mathbb{Z}} \mathbb{Z}/b…
-
It would be nice to have operators for:
- forward and reverse function composition: `()`
- forward and reverse function application: `()`
- mathematical operations: `(+)`, `(-)`, `(*)`, `(/)`
- …
-
I believe the Agda community is in general really nice and friendly to newcomers. (Please let me know if you're a newcomer and you found that's not the case!) Since I hope the community will grow in t…