Bernard Sufrin. CSP-style processes in ML. (Private communication), 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Typing First-Class Continuations in ML - Harper, Duba, MacQueen (1992) (17 citations) (Correct)
....: state cont = produce(n,S k) fun prun ( consume(pinit(0) Coroutines can be generalized to lightweight processes or threads. Continuations have been used as the basis for the implementations of several process facilities for Standard ML of New Jersey, some of which use preemptive scheduling [28, 3, 27, 35]. The following example uses stored continuations to implement a simple backtracking scheme. let val stack : unit cont list ref = ref [ fun pushstate(k : unit cont) stack : k : stack fun popstate( stack : tl( stack) fun backtrack( a = case stack of [ raise Error k : r = ....
Bernard Sufrin. CSP-style processes in ML. (Private communication), 1989.
Typing First-Class Continuations in ML - Duba, Harper, MacQueen (1991) (52 citations) (Correct)
....k : state cont = produce(n,S k) fun prun ( consume(pinit(0) Coroutines can be generalized to lightweight processes or threads. Continuations have been used as the basis for several implementations of process facilities for Standard ML of New Jersey, some of which use preemptive scheduling [29, 5, 28, 37]. The following example uses stored continuations to implement a simple backtracking scheme. let val stack : unit cont list ref = ref [ fun pushstate(k : unit cont) stack : k : stack fun popstate( stack : tl( stack) fun backtrack( a = case stack of [ raise Error k : r = ....
Bernard Sufrin. CSP-style processes in ML. (Private communication), 1989.
Typing First-Class Continuations in ML - Robert Harper (17 citations) (Correct)
....: state cont = produce(n,S k) fun prun ( consume(pinit(0) Coroutines can be generalized to lightweight processes or threads. Continuations have been used as the basis for the implementations of several process facilities for Standard ML of New Jersey, some of which use preemptive scheduling [28, 3, 27, 35]. The following example uses stored continuations to implement a simple backtracking scheme. let val stack : unit cont list ref = ref [ fun pushstate(k : unit cont) stack : k : stack fun popstate( stack : tl( stack) fun backtrack( a = case stack of [ raise Error k : r = ....
Bernard Sufrin. CSP-style processes in ML. (Private communication), 1989.
Typing First-Class Continuations in ML - Duba, Harper, MacQueen (1991) (52 citations) (Correct)
.... : state cont = produce(n,S k) fun prun ( consume(pinit(0) Closely related to coroutines are lightweight processes or threads, and continuations have been used as the basis for several implementations of process facilities for Standard ML of New Jersey, some of which use preemptive scheduling [27, 5, 26, 36]. Another use of continuations is to provide a clean, typed interface for asynchronous signal handling [28] In Standard ML of New Jersey the type of a signal handler is (int unit cont) unit cont, where the argument is a pair consisting of a count of pending signals of the kind being handled, ....
Bernard Sufrin. CSP-style processes in ML. (Private communication), 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC