wip traversal

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

diff --git a/trav-alg.tex b/trav-alg.tex
index 8cbaa9a2cfae6a5f56c4489ac4ff35b27cd01eae..abe24410def1fdeb757404dc30f0d9cbe7ce4f1c 100644 (file)
--- a/trav-alg.tex
+++ b/trav-alg.tex
@@ -69,7 +69,7 @@ In some order, perhaps interleaving the two kinds of merge:
 \item For each $\hasdep$-maximal $\pd \isdirdep \pc$, find a merge base
 $M \le W,\; \le \tipdy$ and merge $\tipdy$ into $W$.
 That is, use $\alg{Merge}$ with $L = W,\; R = \tipdy$.
-(Dependency Merge.)
+(Base Dependency Merge.)
 
 \item For each $S \in S^{\pcn}_i$, merge it into $W$.
 That is, use $\alg{Merge}$ with $L = W,\; R = S,\; M = M^{\pcn}_i$.
@@ -81,6 +81,11 @@ That is, use $\alg{Merge}$ with $L = W,\; R = S,\; M = M^{\pcn}_i$.
 
 Execute $\alg{Fixup-Base}(W,\pc)$.
 
+TODO define Fixup-Base
+
+\subsubsection{Result}
+
+If all of that was successful, let $\tipcn = W$.
 
 \subsection{$\alg{Recreate-Base}(\pc)$}