-
I understand that the current chain implementation can only solve for ``complex-2x2`` Jones terms (with an update type option to reduce them to diagonal or phase-only, see also #54). This is because o…
-
# Motivation
It would be very useful if the following is accepted, or automatically translated away:
```agda
record RawGroupStr (X : Set) : Set where
field
_*_ : X -> X -> X
n : X
…
-
I had decided to use cooltt to experiment with weak universes, i.e. universes where the decoding laws hold up to iso. These are fine, but they make certain things harder — including synthesizing motiv…
-
So now that the Coq re-rankings are complete, I noticed that my Agda rank progress is greater than that for Coq, which is BS because I've been exclusively solving and authoring theorem-proving Kata in…
-
Apparently there is something called Guarded Cubical Agda. I suspect that the two new modalities `@tick` and `@lock` are related to this in some way. However, I didn't find any documentation of these …
-
If schemes are not implemented yet, i wanted to recommend you the reading of Demazure-Gabriel ``groupes algébriques'', because their presentation of schemes should be adapted to a cubical agda impleme…
-
[Elsewhere](https://github.com/agda/agda/issues/4642#issuecomment-1513055271) I wrote the following:
> * Add an option (`--eta-unit`) for allowing non-erased record types with η-equality and no fie…
-
I have encountered a problem in the last step of a development I have been carrying out in Cubical Agda. I have three remaining holes in an equational proof, and the typechecker does not terminate whe…
-
The Llamas' Revolution: A Scene
The llamas had reached the gate tower, the main entrance to the compiler. They had managed to break through the outer wall, using their PPX tools to create a breach in…
-
Subject reduction is lost with `Setω`. Consider
```agda
bad : Setω
bad = λ (ℓ : ⊤ → Level) → ∀ t → Set (ℓ t)) (λ _ → lzero)
```
whose type is `Setω` but after normalisation it becomes
```agda…