either. To prevent the \VHDL\ generation from breaking on these
artifacts, this transformation removes them.
either. To prevent the \VHDL\ generation from breaking on these
artifacts, this transformation removes them.
There are a limited number of literals available in Haskell and Core.
\refdef{enumerated types} When using (enumerating) algebraic
data-types, a literal is just a reference to the corresponding data
There are a limited number of literals available in Haskell and Core.
\refdef{enumerated types} When using (enumerating) algebraic
data-types, a literal is just a reference to the corresponding data
\section{Unsolved problems}
The above system of transformations has been implemented in the prototype
and seems to work well to compile simple and more complex examples of
\section{Unsolved problems}
The above system of transformations has been implemented in the prototype
and seems to work well to compile simple and more complex examples of
system has not seen enough review and work to be complete and work for
every Core expression that is supplied to it. A number of problems
have already been identified and are discussed in this section.
system has not seen enough review and work to be complete and work for
every Core expression that is supplied to it. A number of problems
have already been identified and are discussed in this section.
{\lam{\forall A, B, C \exists D (A ->> B ∧ A ->> C => B ->> D ∧ C ->> D)}}
Here, \lam{A ->> B} means \lam{A} \emph{reduces to} \lam{B}. In
{\lam{\forall A, B, C \exists D (A ->> B ∧ A ->> C => B ->> D ∧ C ->> D)}}
Here, \lam{A ->> B} means \lam{A} \emph{reduces to} \lam{B}. In
- other words, there is a set of transformations that can be applied
- to transform \lam{A} to \lam{B}. \lam{=>} is used to mean
- \emph{implies}.
+ other words, there is a set of transformations that can transform
+ \lam{A} to \lam{B}. \lam{=>} is used to mean \emph{implies}.
For a transformation system holding the Church-Rosser property, it
is easy to show that it is in fact deterministic. Showing that this
For a transformation system holding the Church-Rosser property, it
is easy to show that it is in fact deterministic. Showing that this