redtt
redtt copied to clipboard
"Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
Can we think of a better notation? It's so ugly. Honestly, comp is bad too when it is dependent.
Noticed this with @kaonn today; I'll try and troubleshoot & fix
``` import path import J data vacu where | more (x : vacu) let Code (m : vacu) (n : vacu) : type = elim n [ more n' =>...
Right now, the only kind of "argument type" allowed is just `Self`; this should be generalized to `A -> Self`, where `A` is a type. Combining this with #200, the...
There's a very subtle substitution bug that could potentially be triggered (but none of our examples did). This will be fixed in #270. Technical details: in the last rule on...
The following should be valid, but it requires non-local reasoning: ``` comp x 1 blah [x=0 -> refl | z=0 -> \ y -> comp x y bar [x=0 ->...
AFTER #270.
This WILL be done in #270 unless @jonsterling says no.
The following line is always a no-op. https://github.com/RedPRL/redtt/blob/9392635a6c7dcb7b3afddab8ef5210308426ea36/src/core/Val.ml#L1716 This is fixed in #270, but I want to document this.
The current structure will populate different instances of PersistentTable all over the places, and it is very possible that the expensive `reroot` will be called too many times. Therefore we...