Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!europa.eng.gtefsd.com!howland.reston.ans.net!math.ohio-state.edu!jussieu.fr!univ-lyon1.fr!swidir.switch.ch!newsfeed.ACO.net!Austria.EU.net!EU.net!uunet!munnari.oz.au!cs.mu.OZ.AU!mundil.cs.mu.OZ.AU!bromage
From: bromage@mundil.cs.mu.OZ.AU (Andrew Bromage)
Subject: Refs on compiling & optimising Lisp
Message-ID: <9425516.26020@mulga.cs.mu.OZ.AU>
Sender: news@cs.mu.OZ.AU
Organization: Computer Science, University of Melbourne, Australia
Date: Mon, 12 Sep 1994 06:43:35 GMT
Lines: 13

G'day.

Could someone please give me some refs on optimising Lisp, and abstract 
machine models for Lisp compilers?  I'm particularly interested in more 
recent (post-SECD machine) work, but any old stuff (like FP, optimising
tail recursion, dataflow analysis) will do too.

I am NOT after source code, just theory.

Thanks in advance etc.

Cheers,
Andrew Bromage
