Denotational semantics of a para-functional programming language
A para-functional 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 para-functional programming language with mapping annotations. A precise meaning is given not only to a 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.
- scientific article; zbMATH DE number 408794
- Denotational semantics of a parallel object-oriented language
- scientific article; zbMATH DE number 4009792
- Programming Denotational Semantics II
- Functional semantics
- Computational semantics with functional programming
- Semantics of untyped functional programs
- Denotational semantics of an object-oriented programming language with explicit wrappers
- Denotational semantics of mixed computation processes for a structural programming language
- Denotational semantics for a program logic of objects
- A Transformation System for Developing Recursive Programs
- Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs
- Denotational semantics of a para-functional programming language
- scientific article; zbMATH DE number 3907755 (Why is no real title available?)
- scientific article; zbMATH DE number 3640837 (Why is no real title available?)
This page was built for publication: Denotational semantics of a para-functional programming language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085595)
