Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: Notesfiles $Revision: 1.6.2.17 $; site uiucdcs.UUCP Path: utzoo!watmath!clyde!cbosgd!ihnp4!inuxc!pur-ee!uiucdcs!mccaugh From: mccaugh@uiucdcs.UUCP Newsgroups: net.lang.lisp Subject: Re: Life in net.lang.lisp Message-ID: <18900002@uiucdcs.UUCP> Date: Tue, 1-Jan-85 06:57:00 EST Article-I.D.: uiucdcs.18900002 Posted: Tue Jan 1 06:57:00 1985 Date-Received: Thu, 3-Jan-85 01:11:36 EST References: <313@ecsvax.UUCP> Lines: 12 Nf-ID: #R:ecsvax:-31300:uiucdcs:18900002:000:607 Nf-From: uiucdcs!mccaugh Jan 1 05:57:00 1985 Yes, if you can call it that--life thrives hereabouts...though ofttimes conditions mandate perspicuity. Now, if LISP is so computationally com- plete, it should not be such a chore to implement coroutines. Without the obvious resort to machine-language implementations of "resume" or C-level SWITCH statements, how can this be done in pure LISP? (That it can be done oughtn't to be the question, if LISP is computationally com- plete.) If this can NOT be accomplished in pure LISP, a proof would be warmly welcomed (as evidence that LISP is not so computationally complete). --uiucmsl!mccaugh