Process Semantics of Graph Reduction (1995)
| Venue: | Proc. CONCUR '95, volume 962 of Lecture Notes in Computer Science |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Brock95processsemantics,
author = {Simon Brock and Gerald Ostheimer and North Haugh and Fife Ky Ss},
title = {Process Semantics of Graph Reduction},
booktitle = {Proc. CONCUR '95, volume 962 of Lecture Notes in Computer Science},
year = {1995},
pages = {471--485},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper introduces an operational semantics for call-by-need reduction in terms of Milner's ß-calculus. The functional programming interest lies in the use of ß-calculus as an abstract yet realistic target language. The practical value of the encoding is demonstrated with an outline for a parallel code generator. From a theoretical perspective, the ß-calculus representation of computational strategies with shared reductions is novel and solves a problem posed by Milner [13]. The compactness of the process calculus presentation makes it interesting as an alternative definition of call-by-need. Correctness of the encoding is proved with respect to the call-by-need -calculus of Ariola et al. [3]. 1 Introduction Graph reduction of extended -calculi has become a mature field of applied research. The efficiency of the implementations is due in great measure to a technique known as `sharing', whereby argument values are computed (at most) once and then memoized for future reference. Both...
