[plt-scheme] coroutine versus stream

From: Jos Koot (jos.koot at telefonica.net)
Date: Sat Apr 18 17:54:39 EDT 2009

Thanks, Matthias,
I did a quick search for Talcott 1986, but got so many hits relevevant info is hidden like a leaf on a sound tree.
Can you be more specific? Thanks
  ----- Original Message ----- 
  From: Matthias Felleisen 
  To: Jos Koot 
  Cc: plt-scheme at list.cs.brown.edu 
  Sent: Saturday, April 18, 2009 11:43 PM
  Subject: Re: [plt-scheme] coroutine versus stream

  It is indeed a well-known fact that streams and coroutines are two sides of the same coin. Talcott's 1986 dissertation is the earliest theoretical treatment that I know. -- Matthias

  On Apr 18, 2009, at 5:38 PM, Jos Koot wrote:

    It seems to me that in many cases the same problem can be solved (for an eager evaluater) both by coroutines and by streams. Both solutions very well show the structure of the principal algorithm as might have been written with a lazy evaluator in mind. Which approach would be preferred in terms of efficiency (time and memory). May be you would like to address other aspects as well. One reason that makes me tend to choose streams, is that the latter seem better suited to automatic code generation from purely lazy code.
    Thanks, Jos
      For list-related administrative tasks:

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20090418/a94f8e6e/attachment.html>

Posted on the users mailing list.