-
coqchk gives:
```
CONTEXT SUMMARY
===============
* Theory: Set is predicative
* Axioms:
Coq.ssr.ssrunder.Under_rel.Over_rel
Coq.ssr.ssrunder.Under_rel.Under_rel_from_rel
Coq.s…
-
I'm trying to write code for inclusion in a paper, and hence attempting to make it as readable and succinct as possible. The `Reserved Notation` feature is very convenient for defining relations legi…
-
With impredicative set some inductives have the restriction that they can only be eliminated into `SProp`, `Prop` and `Set`. Coq does not properly check this restriction into Set when polymorphic cons…
-
I have Klipper mainline installed on my SV08. I have acrylic side panels, but no other modifications. No doors, no top.
I typically fire off prints remotely. I had a string of bad prints. There we…
-
-
#### Description of the problem
[Reformulated after interaction with @skyskimmer, then again revised]
While experimenting with postponement of evar/sort subtyping unification problems (#13285), …
-
#### Description of the problem
It is useful when writing inversion-style automation to know how many parameters an inductive type should have. It is also sometimes important to know, given a …
-
The following is not currently supported in Lean4:
```lean
inductive finite_inter_closure : set (set α)
| basic {s} : s ∈ S → finite_inter_closure s
| univ : finite_inter_closure set.univ
| inter…
-
## Introduction
Some things can only be done by a sequence of toplevel commands. For instance, declaring an inductive with `n` constructors involves 1 constant for the inductive, n constants for th…
-
#### Description of the problem
Consider the following:
```coq
Record foo := { bar : list nat }.
Scheme Equality for foo.
(* Error: Unsupported constructor with an argument whose type is a no…