The Semantics of Scheme with Future (1996)
Cached
Download Links
- [www.bib.ecs.soton.ac.uk]
- [www.ecs.soton.ac.uk]
- [www.ecs.soton.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | In In ACM SIGPLAN International Conference on Functional Programming (ICFP'96 |
| Citations: | 19 - 7 self |
BibTeX
@INPROCEEDINGS{Moreau96thesemantics,
author = {Luc Moreau},
title = {The Semantics of Scheme with Future},
booktitle = {In In ACM SIGPLAN International Conference on Functional Programming (ICFP'96},
year = {1996},
pages = {146--156}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
future is an annotation by which the programmer indicates that some expressions may be evaluated in parallel. We present the formal semantics of future in a Scheme-like language which has both side-effects and first-class continuations. Correctness is established by proving that programs annotated by future have the same observable behaviour as their non-annotated counterparts, even though evaluation may be parallel. In this paper, we describe four abstract machines that highlight different aspects of a programming language with future: (i) The CS-machine, a context-rewriting machine, can be regarded as the sequential semantics of the language we deal with. (ii) The P (CS)-machine, also a context-rewriting machine, considers future as a construct that may create parallelism. (iii) The F-PCKS-machine is a refinement of the second machine; it features an explicit shared memory, placeholders, and a notion of legitimacy. (iv) The fourth machine, called the F-PCEKS-machine, further refines...
