wip traversal

[topbloke-formulae.git] / trav-proofs.tex

diff --git a/trav-proofs.tex b/trav-proofs.tex
index 67e1b113b696e79de2680381c0df917654b7488a..415c939b0b03c9675a7dcfa9bfde517fee3de6ab 100644 (file)
--- a/trav-proofs.tex
+++ b/trav-proofs.tex
@@ -3,6 +3,14 @@
 For each operation called for by the traversal algorithms, we prove
 that the commit generation preconditions are met.
 
+\subsection{Base Dependency Merge, Base Sibling Merge}
+
+We do not prove that the preconditions are met.  Instead, we check
+them at runtime.  If they turn out not to be met, we abandon
+\alg{Merge-Base} and resort to \alg{Recreate-Base}.
+
+WIP WHAT ABOUT PROVING ALL THE TRAVERSAL RESULTS
+
 \subsection{Tip Base Merge}
 
 $L = W$, $R = \tipcn$.