$\greffa{\patchof{L}}$.
After we are done, the result has the following properties:
-\[ \eqn{Best Tip}{
+\[ \eqn{Tip Inputs}{
\bigforall_{E_i \in \set E_{\pc}} \greffc \ge E_i
}\]
+\[ \eqn{Tip Dependencies}{
+ \bigforall_{\pc \hasdep \p} \greffc \ge \greffa \p
+}\]
\[ \eqn{Perfect Contents}{
\greffc \haspatch \p \equiv \pc \hasdep \py
}\]
$M = \baseof{L} \haspatch \p$.
By Tip Contents for $L$, $D \le L \equiv D \le M$. $\qed$
-OK
-UP TO HERE
+WIP UP TO HERE
+
+Addition Merge Ends: If $\py \isdep \pcn$, we have already
+done the execution phase for $\pcn$ and $\py$. By
+Perfect Contents for $\pcn$, $\greffa \pcn \haspatch \p$.
+
+computed $\greffa \py$, and by Perfect Contents for $\py$
+
with $M=M_j, L=T_{\pc,j-1}, R=E_j$,
and calculate what the resulting desired direct dependencies file