Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!yeshua.marcam.com!charnel.ecst.csuchico.edu!olivea!uunet!sytex!smcl
From: smcl@sytex.com (Scott McLoughlin)
Subject: Multiple values
Message-ID: <g2mgTc2w165w@sytex.com>
Sender: bbs@sytex.com
Organization: Sytex Access Ltd.
Date: Fri, 30 Sep 1994 10:01:39 GMT
Lines: 26

Howdy,
        Any advice/pointers to literature available on 
efficiently implementing CL multiple values?  I've
picked up  a few general ideas reading through
"Performance and Eval..." and the description of
CMU CL in Lee's (ed) "Topics in Advanced..."  No hard
specifics, though.  I'm particularly interested in
the ways MV and dynamic non-local exits (throw) and
captured (blocks) and (unwind-protect) forms interact.
        In a perfectly tail-recursive world, I can
imagine a very simple implementation, but with the
various forms of dynamic binding, our implementation
is not always perfectly tail recursive as it stands.
        Anyway, as usual, any and all advice deeply
appreciated.

BTW: I wish to sincerely thank Henry Baker for making
.ps versions of many of his papers available on line.
A banquet of food for thought for this (non-academic)
Lisper who doesn't have a university library near at
hand.

=============================================
Scott McLoughlin
Conscious Computing
=============================================
