|
definition:
|
fromCurryProg :: CurryProg -> RWData
fromCurryProg (CurryProg _ _ _ _ _ ts fs _)
= (Map.fromList (map fromFuncDecl fs), ts)
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
Transforms an abstract Curry program into an equivalent representation,
where every function gets assigned the corresponding term rewriting system
and every type has a corresponding type declaration.
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({CurryProg}) |-> {(,)}}
|
|
name:
|
fromCurryProg
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{(,)}
|
|
signature:
|
AbstractCurry.Types.CurryProg
-> (Data.Map.Map (String, String) [(Rewriting.Term.Term (String, String), Rewriting.Term.Term (String, String))], [AbstractCurry.Types.CTypeDecl])
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|