Denotational semantics of a parafunctional programming language
A parafunctional programming language is a functional language that has been extended with special annotations that provide an extra degree of control over parallel evaluation. Of most interest are annotations that allow one to express the dynamic mapping of a program onto a known multiprocessor topology. Since it is quite desirable to provide a precise semantics for any programming language, in this paper a denotational semantics is given for a simple parafunctional programming language with mapping annotations. A precise meaning is given not only to the normal functional behavior of the program (i.e., the answer), but also to the operational notion of where (i.e., on what processor) expressions are evaluated. The latter semantics is accomplished through an abstract entity called an execution tree.
- Research Organization:
- Yale Univ., New Haven, CT
- OSTI ID:
- 6458716
- Journal Information:
- Int. J. Parallel Program.; (United States), Journal Name: Int. J. Parallel Program.; (United States) Vol. 15:2; ISSN IJPPE
- Country of Publication:
- United States
- Language:
- English
Similar Records
Processes and the denotational semantics of concurrency
2DT-FP: A parallel functional programming language on two-dimensional data