Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!bcm!dimacs.rutgers.edu!rutgers!cmcl2!sbcs!sbstaff2!david
From: david@sbstaff2.cs.sunysb.edu (David Connelly)
Newsgroups: comp.lang.functional
Subject: Continuations + Graph Reduction
Message-ID: <1991Jan26.044605.3610@sbcs.sunysb.edu>
Date: 26 Jan 91 04:46:05 GMT
Sender: usenet@sbcs.sunysb.edu (Usenet poster)
Organization: State University of New York at Stony Brook
Lines: 14

Would anyone have any pointers on how to implement continuations
in a graph reduction interpreter based on Turner's combinator set?
I see no difficulty in supporting continuations that are only
passed inwards, but can find no easy solution to supporting continuations
that are returned from the call/cc function. Is there better way
to accomplish this other than to keep a history of all relevant
node changes made after the continuation was created, and using
the history to "undo" these changes after the continuation is invoked?
Any hints would be appreciated.

	Thanks,

	David Connelly
	david@cs.sunysb.edu