Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!ucbvax!decwrl!shelby!csli!johnson
From: johnson@csli.STANFORD.EDU (Mark Johnson)
Newsgroups: comp.lang.prolog
Subject: Re: infinite structures, lazy evaluation
Message-ID: <8540@csli.STANFORD.EDU>
Date: 15 Apr 89 17:29:57 GMT
References: <1632@kulcs.kulcs.uucp> <1942@randvax.UUCP> <1353@murtoa.cs.mu.oz.au> <1944@randvax.UUCP> <986@quintus.UUCP> <1770@etive.ed.ac.uk>
Sender: johnson@csli.Stanford.EDU (Mark Johnson)
Reply-To: johnson@csli.stanford.edu (Mark Johnson)
Organization: Center for the Study of Language and Information, Stanford U.
Lines: 9

Talking about lazy evaluation reminds me of a very interesting
article in New Generation Computing 6, 421-438 by Sato and Tamaki
called "Existential Continuation".

They show how Ueda's continuation passing transformation can be
automatically applied using a _deterministic_ sequence of unfold/fold
transformations, given a set of "mode" declarations.

Mark Johnson