LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
cartesianproducts [2015/04/21 17:43]
wikiadmin
cartesianproducts [2015/04/21 17:43]
wikiadmin
Line 112: Line 112:
  
 The constraints on the patterns are: The constraints on the patterns are:
-\[p_1 = ENode \] +\begin{equation*}p_1 = ENode \end{equation*} 
-\[p_2 = ELeaf \]+\begin{equation*}p_2 = ELeaf \end{equation*}
  
 Completeness is expressed as $p_1 \cup p_2 \supseteq Tree$ and disjointness as $p_1 \cap p_2 = \emptyset$. Both are trivial with our axioms. Completeness is expressed as $p_1 \cup p_2 \supseteq Tree$ and disjointness as $p_1 \cap p_2 = \emptyset$. Both are trivial with our axioms.