Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 (Tek) 9/28/84 based on 9/17/84; site tekla.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!vax135!cornell!uw-beaver!tektronix!teklds!dadla!tekla!kend
From: kend@tekla.UUCP (Ken Dickey)
Newsgroups: net.lang.lisp,net.lang
Subject: loop optimization in applicative languages (ref: S. Debray)
Message-ID: <320@tekla.UUCP>
Date: Sat, 31-Aug-85 22:01:30 EDT
Article-I.D.: tekla.320
Posted: Sat Aug 31 22:01:30 1985
Date-Received: Wed, 4-Sep-85 07:08:58 EDT
Distribution: net
Organization: Tektronix, Beaverton OR
Lines: 38
Xref: watmath net.lang.lisp:538 net.lang:1766

*** 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
---------------------------------------------------