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.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Download (392Kb) |
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 (Other) |
|---|---|
| Additional Information: | Address: Beaune, France |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science |
| Item ID: | 252768 |
| Date Deposited: | 20 Mar 2000 |
| Last Modified: | 02 Mar 2012 14:01 |
| Contributors: | Moreau, Luc (Author) Ribbens, Daniel (Author) Halstead, R. (Editor) Ito, T. (Editor) Queinnec, C. (Editor) |
| Date: | 1995 |
| Additional Information: | Address: Beaune, France |
| Status: | Published |
| Publisher: | Springer-Verlag |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/252768 |
Actions (login required)
 |
View Item |
