Moreau, Luc and Ribbens, Daniel
The Semantics of pcall and fork.
In, PSLS 95 -- Parallel Symbolic Langages and Systems
We present the semantics of the annotations pcall and fork for parallel evaluation of Scheme. Annotated programs are proved to be behaviourly indistinguishable from their non-annotated counterparts, even in the presence of first-class continuations and side-effects. The semantics takes the form of an abstract machine, which can be regarded as a guideline for an implementation.
Actions (login required)