-
```agda
open import Cubical.Core.Primitives
data Interval : Type where
left right : Interval
path : left ≡ right
module _ {ℓ : Level} (P : I → Type ℓ) where
foo : Interval → Type ℓ
…
-
Now I got again a situation in which ~idi was added to a proof during minimization:
Theorem with original proof:
$( The closed (internal binary) operations for a set. (Contributed by AV,
…
-
**Describe the bug**
The title describes it pretty well, I did this by accident when respecing and I clicked further down the tree than I'd intended.
If you don't have enough Time Theorems to unlo…
-
Very often, I'll start with the same composite cells. For example in http://globular.science/1607.001, I don't know how many times I've put a pair of copants on top of a pair of pants. It would be gre…
-
Instead of
```html
Solution.
...
```
What about
```html
Solution.
...
```
This would make proofs collapsible. Which seems like a really nice feature of html which you can not…
-
https://virtual2023.aclweb.org/paper_P35.html
-
When I do a "search" I can enter a pattern (great!). In addition, when I use patterns like `4 =` or `T. ` I get very sensible results.
However, when I do some pattern searches I don't get the resul…
-
### Proposal
There's a few places in Std and Mathlib where there is a desire to filter out auto-generated and other stable names (e.g., leanprover/std4#347 and leanprover/std4#355).
I think this…
-
see https://stacks.math.columbia.edu/ this has a couple of thousands of math pages.
-
### Proposal
Currently pattern matching with `let` doesn't keep the definition of the value. I believe this conflicts with the rest of the behavior of `let` and is confusing, especially for new use…