The Semantics of pcall and fork


Moreau, Luc and Ribbens, Daniel, (1995) The Semantics of pcall and fork Halstead, R., Ito, T. and Queinnec, C. (eds.) At PSLS 95 -- Parallel Symbolic Langages and Systems. , p. 52.

Download

[img] PDF The_Semantics_of_pcall_and_fork_in_the_presence_of_firs-class_continuations_and_side-effects.pdf - Accepted Manuscript
Download (401kB)

Description/Abstract

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 (Paper)
Additional Information: Address: Beaune, France
Venue - Dates: PSLS 95 -- Parallel Symbolic Langages and Systems, 1995-01-01
Organisations: Web & Internet Science
ePrint ID: 252768
Date :
Date Event
1995Published
Date Deposited: 20 Mar 2000
Last Modified: 17 Apr 2017 23:29
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/252768

Actions (login required)

View Item View Item