Path: utzoo!attcan!uunet!husc6!cmcl2!nrl-cmf!ames!pasteur!agate!saturn!venus.ucsc.edu!kjell
From: kjell@venus.ucsc.edu (Kjell Post)
Newsgroups: comp.lang.scheme
Subject: Intermediate Lambda Calculus --> Machine code
Message-ID: <4742@saturn.ucsc.edu>
Date: 6 Sep 88 17:53:22 GMT
Sender: usenet@saturn.ucsc.edu
Reply-To: kjell@venus.ucsc.edu (Kjell Post)
Organization: University of California, Santa Cruz; CIS/CE
Lines: 14


I am looking for articles, books etc that describes various ways
of compiling intermediate lambda calculus (eg, produced by a 
compiler for a functional language or a denotational description
of any programming language) to real machine code. The work that
I've seen usually employs some abstract machine (SECD, G, CAM etc)
or relies on a selected set of combinators (Wand, Sethi).

Email please. Thanks.

-------------------------------------------------------------------------------
   Y F = F(Y F)                    ! Kjell Post, Dept of Comp & Info Sciences
"This superamazing, clever thing"  ! University of California, Santa Cruz
		-- G.J.Sussman     ! Email: kjell@saturn.ucsc.edu