Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!rutgers!cmcl2!lanl!opus!ted From: ted@nmsu.edu (Ted Dunning) Newsgroups: comp.sw.components Subject: Re: Assignment in Ada, etc. Message-ID: Date: 5 Oct 89 23:13:40 GMT References: <6592@hubcap.clemson.edu> <93301@ti-csl.csc.ti.com> Sender: news@nmsu.edu Organization: NMSU Computer Science Lines: 29 In-reply-to: gateley@m2.csc.ti.com's message of 4 Oct 89 23:10:50 GMT In article <93301@ti-csl.csc.ti.com> gateley@m2.csc.ti.com (John Gateley) writes: In article ted@nmsu.edu (Ted Dunning) writes: >trivial and lucid in lisps that support continuations and/or engines. ^^^^^^^ Continuations do not really support multitasking: they merely (:^) represent the flow of control within a single task. However, there are several Lisp's which do support multi-tasking: Bertram Hallam's multi-lisp, QLisp by Gabriel and ?, and others I'm sure. (please forgive inaccuracies in the refs, I am not up to date on the topic). On a more practical level, there are the stack group's of the explorer (probably first done by symbolics). sorry for the and/or. engines are definitely designed with multi-tasking support in mind. as for continuations, it was my impression (untested) that it would not be hard to implement coroutines with first-class continuations. anyone care to demonstrate the matter either way? -- ted@nmsu.edu remember, when extensions and subsets are outlawed, only outlaws will have extensions or subsets