strategy: move traversal proofs inline

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

diff --git a/trav-proofs.tex b/trav-proofs.tex
index 981483e1c92c77f7c9d94811efe23b87e4e3ff58..e69de29bb2d1d6434b8b29ae775ad8c2e48c5391 100644 (file)
--- a/trav-proofs.tex
+++ b/trav-proofs.tex
@@ -1,44 +0,0 @@
-\section{Traversal phase --- proofs}
-
-For each operation called for by the traversal algorithms, we prove
-that the commit generation preconditions are met.
-
-WIP WHAT ABOUT PROVING ALL THE TRAVERSAL RESULTS
-
-\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}.
-
-TODO COMPLETE MERGE-BASE STUFF
-
-WIP WHAT ABOUT PROVING ALL THE TRAVERSAL RESULTS
-
-\subsection{Recreate Base Beginning}
-
-WHAT IF $\pendsof{L}{\pqy} \neq \{\}$ ?
-FIX BY CHANGE PRECOND OF CREATE BASE
-
-\subsection{Tip Base Merge}
-
-$L = W$, $R = \tipcn$.
-
-TODO TBD
-
-Afterwards, $\baseof{W} = \tipcn$.
-
-\subsection{Tip Source Merge}
-
-In fact, we do this backwards: $L = S$, $R = W$.  Since $S \in \pcy$,
-the resulting $C \in \pcy$ and the remaining properties of the Merge
-commit construction are symmetrical in $L$ and $R$ so this is fine.
-
-By the results of Tip Base Merge, $\baseof{W} = \tipcn$.
-
-By Base Ends Supreme, $\tipcn \ge \baseof{S}$ i.e.
-$\baseof{R} \ge \baseof{L}$.
-
-Either $\baseof{L} = \baseof{M}$, or we must choose a different $M$ in
-which case $M = \baseof{S}$ will suffice.
-