Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles $Revision: 1.6.2.16 $; site ima.UUCP
Path: utzoo!decvax!cca!ima!compilers
From: compilers@ima.UUCP
Newsgroups: mod.compilers
Subject: loop optimization in declarative lan
Message-ID: <136300069@ima.UUCP>
Date: Sun, 9-Feb-86 13:46:00 EST
Article-I.D.: ima.136300069
Posted: Sun Feb  9 13:46:00 1986
Date-Received: Mon, 10-Feb-86 01:44:09 EST
Lines: 17
Approved: compilers@ima.uucp
Nf-ID: #N:ima:136300069:000:704
Nf-From: ima!compilers    Feb  9 13:46:00 1986


[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