projects
/
matthijs
/
master-project
/
report.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (from parent 1:
aab3b54
)
Fix some typos.
author
Matthijs Kooijman
<m.kooijman@student.utwente.nl>
Wed, 3 Jun 2009 10:24:27 +0000
(12:24 +0200)
committer
Matthijs Kooijman
<m.kooijman@student.utwente.nl>
Wed, 3 Jun 2009 10:24:27 +0000
(12:24 +0200)
Core2Core.tex
patch
|
blob
|
history
diff --git
a/Core2Core.tex
b/Core2Core.tex
index d62807715c21bd530530fd2077cb5a285136a9f9..f576b7196e71b52f6e51fcd2fbb57efd24ba042e 100644
(file)
--- a/
Core2Core.tex
+++ b/
Core2Core.tex
@@
-63,7
+63,7
@@
Matthijs Kooijman
\section{Introduction}
As a new approach to translating Core to VHDL, we investigate a number of
transformations on our Core program, which should bring the program into a
\section{Introduction}
As a new approach to translating Core to VHDL, we investigate a number of
transformations on our Core program, which should bring the program into a
-well-defined "canonical"
state
, which is subsequently trivial to translate to
+well-defined "canonical"
form
, which is subsequently trivial to translate to
VHDL.
The transformations as presented here are far from complete, but are meant as
VHDL.
The transformations as presented here are far from complete, but are meant as
@@
-73,16
+73,16
@@
apparent from the end result, there will be additional transformations needed
to fully reach our goal, and some transformations must be applied more than
once. How exactly to (efficiently) do this, has not been investigated.
to fully reach our goal, and some transformations must be applied more than
once. How exactly to (efficiently) do this, has not been investigated.
-Lastly, I hope to be able to state a number of pre- and postconditi
no
s for
+Lastly, I hope to be able to state a number of pre- and postconditi
on
s for
each transformation. If these can be proven for each transformation, and it
each transformation. If these can be proven for each transformation, and it
-can be shown that ther exists some ordering of transformations for which the
+can be shown that ther
e
exists some ordering of transformations for which the
postcondition implies the canonical form, we can show that the transformations
do indeed transform any program (probably satisfying a number of
preconditions) to the canonical form.
\section{Goal}
The transformations described here have a well-defined goal: To bring the
postcondition implies the canonical form, we can show that the transformations
do indeed transform any program (probably satisfying a number of
preconditions) to the canonical form.
\section{Goal}
The transformations described here have a well-defined goal: To bring the
-program in a well-defined
progra
m that is directly translatable to hardware,
+program in a well-defined
for
m that is directly translatable to hardware,
while fully preserving the semantics of the program.
This {\em canonical form} is again a Core program, but with a very specific
while fully preserving the semantics of the program.
This {\em canonical form} is again a Core program, but with a very specific
@@
-214,14
+214,14
@@
canonical form.
in
case s of
(a, b) ->
in
case s of
(a, b) ->
-
r =
case a of
-
High -> add
-
Low -> let
-
op' = case b of
-
High -> sub
-
Low -> \c d -> c
-
in
-
\c d -> op' d c
+ case a of
+ High -> add
+ Low -> let
+ op' = case b of
+ High -> sub
+ Low -> \c d -> c
+ in
+ \c d -> op' d c
\stoptyping
\subsection{Argument extraction}
\stoptyping
\subsection{Argument extraction}