Newsgroups: comp.lang.scheme
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!newsfeed.internetmci.com!howland.reston.ans.net!ix.netcom.com!netcom.com!NewsWatcher!user
From: hbaker@netcom.com (Henry Baker)
Subject: Re: CPS algorithms/source
Message-ID: <hbaker-1602962318430001@10.0.2.15>
Sender: hbaker@netcom14.netcom.com
Organization: nil organization
References: <311BC624.6A9A@ccm.jf.intel.com>
Date: Sat, 17 Feb 1996 07:18:43 GMT
Lines: 27

In article <311BC624.6A9A@ccm.jf.intel.com>, Patrick Logan
<patrick_d_logan@ccm.jf.intel.com> wrote:

> I am looking for descriptions or source for converting
> the core Scheme expressions to Continuation Passing Style:
> (lambda, if, application), as well as source-to-source
> conversions: (alpha, beta, ?) for simplifying the CPS-style
> source.
> 
> If I recall, there is at least partial information in:
> * Steele's Rabbit thesis.
> * A paper and a thesis (Kranz?) on the Orbit compiler for T.
> * The EOPL book by Friedman, Wand, and Haynes.
> 
> Send me some mail or respond here if you can confirm these
> or other references as good ones to consider.

One of the earlier references is Michael Fischer's 1972? paper, which
was updated & reprinted in Lisp & Symbolic Computation.

See also my 'Cheney on the MTA' and cboyer.c stuff in my www/ftp
directory.

-- 
www/ftp directory:
ftp://ftp.netcom.com/pub/hb/hbaker/home.html

