The University of Southampton
University of Southampton Institutional Repository

The PCKS-machine. An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations

The PCKS-machine. An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations
The PCKS-machine. An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations
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.
424
Moreau, Luc
033c63dd-3fe9-4040-849f-dfccbe0406f8
Moreau, Luc
033c63dd-3fe9-4040-849f-dfccbe0406f8

Moreau, Luc (1994) The PCKS-machine. An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations. European Symposium on Programming (ESOP'94). p. 424 .

Record type: Conference or Workshop Item (Paper)

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.

Text
The_PCKS-Machine.pdf - Accepted Manuscript
Download (278kB)

More information

Published date: 1994
Additional Information: Address: Edinburgh, Scotland
Venue - Dates: European Symposium on Programming (ESOP'94), 1994-01-01
Organisations: Web & Internet Science

Identifiers

Local EPrints ID: 252766
URI: http://eprints.soton.ac.uk/id/eprint/252766
PURE UUID: f86b759b-dc59-4fdb-b724-2a03bef84d74
ORCID for Luc Moreau: ORCID iD orcid.org/0000-0002-3494-120X

Catalogue record

Date deposited: 20 Mar 2000
Last modified: 14 Mar 2024 05:23

Export record

Contributors

Author: Luc Moreau ORCID iD

Download statistics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×