data path -> data-path

1 files changed, 1 insertions, 1 deletions

diff --git a/proof.tex b/proof.tex
index 8ff212b..36b997b 100644
--- a/proof.tex
+++ b/proof.tex
@@ -36,7 +36,7 @@ We prove this lemma by first establishing a specification of the translation fun
 \subsubsection{From Implementation to Specification}\label{sec:proof:3ac_htl:specification}
 
 %To simplify the proof, instead of using the translation algorithm as an assumption, as was done in Lemma~\ref{lemma:htl}, a specification of the translation can be constructed instead which contains all the properties that are needed to prove the correctness.  For example, for the translation from 3AC to HTL, 
-The specification for the translation of 3AC instructions into HTL data path and control logic can be defined by the following predicate:
+The specification for the translation of 3AC instructions into HTL data-path and control logic can be defined by the following predicate:
 \begin{equation*}
   \yhfunction{spec\_instr } \textit{fin rtrn }\ \sigma\ \textit{stk }\ i\ \textit{data }\ \textit{control}
 \end{equation*}