Age | Commit message (Collapse) | Author |
|
In the presence of shape-changing updates, bff needs to shrink one of
the mappings before unifying them. As long the shape does not change,
the union becomes a disjoint union. With this insight we can adapt the
proof of theorem-1 using the adapted lemma-disjoint-union. Unfortunately
theorem-2 requires more work and assoc-enough becomes non-trivial due to
the introduction of mapMV.
|
|
Also rename fmap to _<$>_ to match Agda naming conventions. The imported
_>>=_ appears to have different binding, so some braces were necessary.
|
|
This removes imports.
|
|
|
|
|
|
Suggested by Joachim Breitner.
|
|
|
|
|
|
|
|
|
|
Also adapt depending modules. Long lines generally become shorter. The
misleading name "EqInst" (hiding the decidability) got discarded.
|
|
And update Bidir and Precond, cause they import BFF.
|
|
The import of CheckInsert was broken in previous commit.
|
|
|
|
This way of naming things is more similar to the standard library and to
my own \::-injective. Suggested by Andres Loeh.
|
|
If get on Fin results in Vecs whose elements are unique, then theorem-2
can be applied.
|