compilers@ima.UUCP (02/09/86)
[from allegra!sbcs!debray (Saumya Debray)]
Since this group seems to have been dormant for a while now, let me propose
a new topic: static optimization of declarative languages.
Specifically, I'm interested in loop optimization in pure declarative
languages. For example, since loops in such languages are written as
tail-recursive procedures, it's not clear to me how one would give
reasonably general criteria for _recognizing_ when two such loops could be
merged (once candidates for loop fusion have been identified, the actual
fusion itself doesn't seem too difficult using fold/unfold transformations).
Any suggestions?
-Saumya Debray
SUNY at Stony Brook
{allegra, philabs}!sbcs!debray