The Semantics of pcall and fork

Moreau, Luc and Ribbens, Daniel (1995) The Semantics of pcall and fork. In, PSLS 95 -- Parallel Symbolic Langages and Systems Springer-Verlag, 52.


[img] PDF
Download (392Kb)


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.

Item Type: Conference or Workshop Item (Other)
Additional Information: Address: Beaune, France
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 252768
Accepted Date and Publication Date:
Date Deposited: 20 Mar 2000
Last Modified: 31 Mar 2016 13:53
Further Information:Google Scholar

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics