debray@sbcs.UUCP (Saumya Debray) (08/20/85)
I'm looking for references to work that has been done on loop optimization
in applicative languages. I know about TRO, research on recursion
removal, and Ullman, Fong et al.'s work on induction variable elimination in
very high level languages. I'm thinking of the kinds of loop optimization
usually associated with imperative languages (loop jamming, code motion etc.)
Any help in this matter will be appreciated. If there's sufficient interest,
of course, I'll summarize and post to the net.
--
Saumya Debray
SUNY at Stony Brook
uucp: {allegra, hocsd, philabs, ogcvax} !sbcs!debray
arpa: debray%suny-sb.csnet@csnet-relay.arpa
CSNet: debray@sbcs.csnetkend@tekla.UUCP (Ken Dickey) (09/01/85)
*** REPLACE THIS LINE WITH A COPY OF THIS LINE *** Interesting work and pointers can be found in: Guy Steele -- "RABBIT, A Compiler For Scheme", AI-TR-474, MIT (1978). -- "Compiler Optimization Based on Viewing LAMBDA as RENAME Plus GOTO", in "AI: A MIT Perspective", Vol 2, Winston & Brown Editors, MIT Press (1980). Mitchell Wand -- "Loops in Combinator-Based Compilers", ACM Princ of Prog Lang Conf Proceedings (1983). -- "Continuation-Based Program Transformation Strategies", JACM 27, 1 (Jan 1980). -- "Deriving Target Code as a Representation of Continuation Semantics", ACM TOPLAS 4, 3 (July 1982) D. Turner -- "A New Implementation Technique for Applicative Languages", Software--Practice & Experience, 9, 31-34 (1978). Aside from RABBIT, which is well worth getting, all of the above should be available in any good CS research library. -Ken Dickey --------------------------------------------------- UUCP: HOST!tektronix!tekla!kend Where HOST is any one of: masscomp,decvax,allegra,uf-cgrl,mit-eddie,mit-ems, uoregon,psu-cs,orstcs,zehntel,ucbcad,ucbvax,purdue, uw-beaver,reed, ogcvax,ihnp4,tekred,minn-ua,cbosg CSnet: kend%tekla@tektronix ARPAnet: kend%tekla%tektronix@csnet-relay ---------------------------------------------------