X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ian/git?a=blobdiff_plain;f=article.tex;h=3f066dc59b5275790551472e2735cf50ceeffc73;hb=2fdf30e540acfd5fb9feaee16ae1298bdf84ed8d;hp=d3f553ae456bc24b381ff4c3a254996c2073f9c4;hpb=f1b9b1b48454371485cb29bb2ed6c0a15859f7fb;p=topbloke-formulae.git

diff --git a/article.tex b/article.tex
index d3f553a..3f066dc 100644
--- a/article.tex
+++ b/article.tex
@@ -34,6 +34,10 @@
 \newcommand{\py}{\pay{P}}
 \newcommand{\pn}{\pan{P}}
 
+\newcommand{\pq}{\pa{Q}}
+\newcommand{\pqy}{\pay{Q}}
+\newcommand{\pqn}{\pan{Q}}
+
 \newcommand{\pr}{\pa{R}}
 \newcommand{\pry}{\pay{R}}
 \newcommand{\prn}{\pan{R}}
@@ -293,6 +297,44 @@ by the LHS.  And $A \le A''$.
 }\]
 xxx proof tbd
 
+\[ \eqn{Ingredients Prevent Replay:}{
+  \left[
+    {C \hasparents \set A} \land
+   \\
+    \left(
+      D \isin C \implies
+       D = C \lor
+       \Largeexists_{A \in \set A} D \isin A
+    \right)
+  \right] \implies \left[
+    D \isin C \implies D \le C
+  \right]
+}\]
+\proof{
+  Trivial for $D = C$.  Consider some $D \neq C$, $D \isin C$.
+  By the preconditions, there is some $A$ s.t. $D \in \set A$
+  and $D \isin A$.  By No Replay for $A$, $D \le A$.  And
+  $A \le C$ so $D \le C$.
+}
+
+\[ \eqn{Simple Foreign Inclusion:}{
+  \left[
+    C \hasparents \{ L \}
+   \land
+    \bigforall_{D} D \isin C \equiv D \isin L \lor D = C
+  \right]
+ \implies
+   \bigforall_{D \text{ s.t. } \patchof{D} = \bot}
+     D \isin C \equiv D \le C
+}\]
+\proof{
+Consider some $D$ s.t. $\patchof{D} = \bot$.
+If $D = C$, trivially true.  For $D \neq C$,
+by Foreign Inclusion of $D$ in $L$, $D \isin L \equiv D \le L$.
+And by Exact Ancestors $D \le L \equiv D \le C$.
+So $D \isin C \equiv D \le C$.
+}
+
 \[ \eqn{Totally Foreign Contents:}{
   \bigforall_{C \hasparents \set A}
    \left[
@@ -312,37 +354,6 @@ If $D \neq C$ then $D \le A$ where $A \in \set A$.  By Foreign
 Contents of $A$, $\patchof{D} = \bot$.
 }
 
-\subsection{No Replay for Merge Results}
-
-If we are constructing $C$, with,
-\gathbegin
-  \mergeof{C}{L}{M}{R}
-\gathnext
-  L \le C
-\gathnext
-  R \le C
-\end{gather}
-No Replay is preserved.  \proofstarts
-
-\subsubsection{For $D=C$:} $D \isin C, D \le C$.  OK.
-
-\subsubsection{For $D \isin L \land D \isin R$:}
-$D \isin C$.  And $D \isin L \implies D \le L \implies D \le C$.  OK.
-
-\subsubsection{For $D \neq C \land D \not\isin L \land D \not\isin R$:}
-$D \not\isin C$.  OK.
-
-\subsubsection{For $D \neq C \land (D \isin L \equiv D \not\isin R)
- \land D \not\isin M$:}
-$D \isin C$.  Also $D \isin L \lor D \isin R$ so $D \le L \lor D \le
-R$ so $D \le C$.  OK.
-
-\subsubsection{For $D \neq C \land (D \isin L \equiv D \not\isin R)
- \land D \isin M$:}
-$D \not\isin C$.  OK.
-
-$\qed$
-
 \section{Commit annotation}
 
 We annotate each Topbloke commit $C$ with:
@@ -351,10 +362,10 @@ We annotate each Topbloke commit $C$ with:
 \gathnext
  \baseof{C}, \text{ if } C \in \py
 \gathnext
- \bigforall_{\pa{Q}} 
-   \text{ either } C \haspatch \pa{Q} \text{ or } C \nothaspatch \pa{Q}
+ \bigforall_{\pq}
+   \text{ either } C \haspatch \pq \text{ or } C \nothaspatch \pq
 \gathnext
- \bigforall_{\pay{Q} \not\ni C} \pendsof{C}{\pay{Q}}
+ \bigforall_{\pqy \not\ni C} \pendsof{C}{\pqy}
 \end{gather}
 
 $\patchof{C}$, for each kind of Topbloke-generated commit, is stated
@@ -363,14 +374,14 @@ in the summary in the section for that kind of commit.
 Whether $\baseof{C}$ is required, and if so what the value is, is
 stated in the proof of Unique Base for each kind of commit.
 
-$C \haspatch \pa{Q}$ or $\nothaspatch \pa{Q}$ is represented as the
-set $\{ \pa{Q} | C \haspatch \pa{Q} \}$.  Whether $C \haspatch \pa{Q}$
+$C \haspatch \pq$ or $\nothaspatch \pq$ is represented as the
+set $\{ \pq | C \haspatch \pq \}$.  Whether $C \haspatch \pq$
 is in stated
-(in terms of $I \haspatch \pa{Q}$ or $I \nothaspatch \pa{Q}$
+(in terms of $I \haspatch \pq$ or $I \nothaspatch \pq$
 for the ingredients $I$),
 in the proof of Coherence for each kind of commit.
 
-$\pendsof{C}{\pa{Q}^+}$ is computed, for all Topbloke-generated commits,
+$\pendsof{C}{\pq^+}$ is computed, for all Topbloke-generated commits,
 using the lemma Calculation of Ends, above.
 We do not annotate $\pendsof{C}{\py}$ for $C \in \py$.  Doing so would
 make it wrong to make plain commits with git because the recorded $\pends$
@@ -389,7 +400,8 @@ This also covers Topbloke-generated commits on plain git branches:
 Topbloke strips the metadata when exporting.
 
 \subsection{No Replay}
-Trivial.
+
+Ingredients Prevent Replay applies.  $\qed$
 
 \subsection{Unique Base}
 If $A, C \in \py$ then by Calculation of Ends for
@@ -474,7 +486,7 @@ Given $L$, create a Topbloke base branch initial commit $B$.
 \gathbegin
  B \hasparents \{ L \}
 \gathnext
- \patchof{B} = \pan{B}
+ \patchof{B} = \pqn
 \gathnext
  D \isin B \equiv D \isin L \lor D = B
 \end{gather}
@@ -484,35 +496,114 @@ Given $L$, create a Topbloke base branch initial commit $B$.
 \[ \eqn{ Ingredients }{
  \patchof{L} = \pa{L} \lor \patchof{L} = \bot
 }\]
-\[ \eqn{ Non-recursion }{
- L \not\in \pa{B}
+\[ \eqn{ Create Acyclic }{
+ L \not\haspatch \pq
 }\]
 
 \subsection{No Replay}
 
-If $\patchof{L} = \pa{L}$, trivial by Base Acyclic for $L$.
+Ingredients Prevent Replay applies.  $\qed$
+
+\subsection{Unique Base}
+
+Not applicable.
+
+\subsection{Tip Contents}
+
+Not applicable.
+
+\subsection{Base Acyclic}
+
+Consider some $D \isin B$.  If $D = B$, $D \in \pqn$.
+If $D \neq B$, $D \isin L$, and by Create Acyclic
+$D \not\in \pqy$.  $\qed$
+
+\subsection{Coherence and Patch Inclusion}
+
+Consider some $D \in \p$.
+$B \not\in \py$ so $D \neq B$.  So $D \isin B \equiv D \isin L$
+and $D \le B \equiv D \le L$.
 
-If $\patchof{L} = \bot$, xxx
+Thus $L \haspatch \p \implies B \haspatch P$
+and $L \nothaspatch \p \implies B \nothaspatch P$.
 
-Trivial from Base Acyclic for $L$.  $\qed$
+$\qed$.
+
+\subsection{Foreign Inclusion}
+
+Simple Foreign Inclusion applies. $\qed$
+
+\subsection{Foreign Contents}
+
+Not applicable.
+
+\section{Create Tip}
+
+Given a Topbloke base $B$, create a tip branch initial commit B.
+\gathbegin
+ C \hasparents \{ B \}
+\gathnext
+ \patchof{B} = \pqy
+\gathnext
+ D \isin C \equiv D \isin B \lor D = C
+\end{gather}
+
+\subsection{Conditions}
+
+\[ \eqn{ Ingredients }{
+ \patchof{B} = \pqn
+}\]
+\[ \eqn{ No Sneak }{
+ \pendsof{B}{\pqy} = \{ \}
+}\]
+
+\subsection{No Replay}
+
+Ingredients Prevent Replay applies.  $\qed$
 
 \subsection{Unique Base}
 
-Not applicable. $\qed$
+Trivially, $\pendsof{C}{\pqn} = \{B\}$ so $\baseof{C} = B$.  $\qed$
 
 \subsection{Tip Contents}
 
-Not applicable. $\qed$
+Consider some arbitrary commit $D$.  If $D = C$, trivially satisfied.
+
+If $D \neq C$, $D \isin C \equiv D \isin B$.
+By Base Acyclic of $B$, $D \isin B \implies D \not\in \pqy$.
+So $D \isin C \equiv D \isin \baseof{B}$.
+
+$\qed$
 
 \subsection{Base Acyclic}
 
-xxx
+Not applicable.
 
-xxx unfinished
+\subsection{Coherence and Patch Inclusion}
 
-\section{Create Tip}
+$$
+\begin{cases}
+  \p = \pq    \lor B \haspatch \p : & C \haspatch \p \\
+  \p \neq \pq \land B \nothaspatch \p : & C \nothaspatch \p
+\end{cases}
+$$
+
+\proofstarts
+~ Consider some $D \in \py$.
+
+\subsubsection{For $\p = \pq$:}
+
+By Base Acyclic, $D \not\isin B$.  So $D \isin C \equiv D = C$.
+By No Sneak, $D \le B \equiv D = C$.  Thus $C \haspatch \pq$.
+
+\subsubsection{For $\p \neq \pq$:}
+
+$D \neq C$.  So $D \isin C \equiv D \isin B$,
+and $D \le C \equiv D \le B$.
+
+$\qed$
 
-xxx tbd
+xxx up to here
 
 \section{Anticommit}
 
@@ -542,7 +633,7 @@ R^+ \in \pry \land R^- = \baseof{R^+}
  L \haspatch \pry
 }\]
 
-\subsection{Ordering of ${L, R^+, R^-}$:}
+\subsection{Ordering of Ingredients:}
 
 By Unique Tip, $R^+ \le L$.  By definition of $\base$, $R^- \le R^+$
 so $R^- \le L$.  So $R^+ \le C$ and $R^- \le C$.
@@ -553,7 +644,10 @@ is a descendant, not an ancestor, of the 2nd parent.)
 
 \subsection{No Replay}
 
-No Replay for Merge Results applies.  $\qed$
+By definition of $\merge$,
+$D \isin C \implies D \isin L \lor D \isin R^- \lor D = C$.
+So, by Ordering of Ingredients,
+Ingredients Prevent Replay applies.  $\qed$
 
 \subsection{Desired Contents}
 
@@ -639,7 +733,7 @@ $\qed$
 
 \subsection{Foreign Contents}
 
-Not applicable. $\qed$
+Not applicable.
 
 \section{Merge}
 
@@ -707,7 +801,10 @@ is therefore consistent with our scheme.
 
 \subsection{No Replay}
 
-No Replay for Merge Results applies.  $\qed$
+By definition of $\merge$,
+$D \isin C \implies D \isin L \lor D \isin R \lor D = C$.
+So, by Ingredients,
+Ingredients Prevent Replay applies.  $\qed$
 
 \subsection{Unique Base}