Curry: An Integrated Functional Logic Language

After applying these transformation steps to all rules in the program, we obtain a program without
sections and λ-abstractions where all local declarations contain only free variables. Note that
partial applications are not eliminated since they can be treated as shown in Section D.5.
The final program might not be a valid Curry program due to the transformation of where
declarations into let declarations. In order to obtain a valid Curry program, we can perform the
following final transformations:
Transform l = let decls in (c|r) into l | c = r where decls
and l = let decls in r into l = r where decls
The latter transformation is only necessary if r is not of type Success.
77