The PCKS-machine. An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations
Moreau, Luc (1994) The PCKS-machine. An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations. In, European Symposium on Programming (ESOP'94) Springer-Verlag, 424.
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
Download (272Kb) |
Description/Abstract
We present the PCKS-machine an abstract machine which evaluates parallel functional programs with first-class continuations. The PCKS-machine is a MIMD-machine with a shared memory which is commonly used to implement such languages. Parallelism is introduced by a construct pcall which provides a fork-and-join type of parallelism. This construct is expected to be an annotation for parallel evaluation which does not change the meaning of sequential programs. To our knowledge, this is the first implementation of such a language proved to be correct: we proved that an annotated program is observationally equivalent to its non annotated counterpart. This machine is also characterised by the non-speculative invocation of continuations whose interest is illustrated in an application.
| Item Type: | Conference or Workshop Item (Other) |
|---|---|
| Additional Information: | Address: Edinburgh, Scotland |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science |
| Item ID: | 252766 |
| Date Deposited: | 20 Mar 2000 |
| Last Modified: | 02 Mar 2012 05:33 |
| Contributors: | Moreau, Luc (Author) |
| Date: | 1994 |
| Additional Information: | Address: Edinburgh, Scotland |
| Status: | Published |
| Publisher: | Springer-Verlag |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/252766 |
Actions (login required)
 |
View Item |
