traversal: proof of Tip Correct Contents

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

diff --git a/trav-proofs.tex b/trav-proofs.tex
index 415c939b0b03c9675a7dcfa9bfde517fee3de6ab..876525dd7253d56f8963a23d41f6d71f02a1a52e 100644 (file)
--- a/trav-proofs.tex
+++ b/trav-proofs.tex
@@ -3,14 +3,39 @@
 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{Traversal Lemmas}
+
+Firstly, some lemmas.
+\statement{Tip Correct Contents}{
+  \tipcy \haspatch \pd
+    \equiv
+  \pd = \pc \lor \pd \isdep \pc
+}
+\proof{
+  For $\pc = \pd$, Tip Own Contents suffices.
+  For $\pc \neq \pd$, Exclusive Tip Contents
+  gives $D \isin \tipcy \equiv D \isin \baseof{\tipcy}$
+  which by Correct Base $\equiv D \isin \tipcn$.
+}
+
 \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}
+
+\subsubsection{Create Acyclic}
+
+$L = \tipdy$ so
+
 \subsection{Tip Base Merge}
 
 $L = W$, $R = \tipcn$.