| F. Loulergue and G. Hains. Parallel functional programming with explicit processes: Beyond SPMD. In To appear in Euro-Par'97, Passau, Germany, 1997. |
....of distributed concrete structures and continuous functions as denotational semantics for a language a la Berry Curien. An operational semantics is defined and full abstraction is proved. The possibility of mixing data parallelism with control parallelism in this language was illustrated in [15]. Our language inherits one of CDS s key features: expressions of function types may be evaluated, making event dependencies explicit. Finally, we replace continuous functions by the deterministic parallel algorithms of Brookes and Geva to obtain array algorithms whose time as well as space is ....
....overlooked at the categorical level. A programming language based on this construction uses a syntax where cells are named with their location. In other words, location is part of the cell name and no implicit link is made between cells having the same de located name. This is the syntax used in [15], with the understanding that a practical version of the language would also provide location abstraction mechanisms. Definition 1 Let M = C M ; M ) VM ; EM ; M ; M ) and N = C N ; N ) VN ; EN ; N ; N ) be two distributed concrete structures. The product M Theta N is defined as the ....
F. Loulergue and G. Hains. Parallel functional programming with explicit processes: Beyond SPMD. In To appear in Euro-Par'97, Passau, Germany, 1997.
....Languages] Language Classifications Parallel languages General Terms: Parallel Programming, Functional Languages Additional Key Words and Phrases: Distributed concrete data structures, deterministic parallel programs, compositional semantics, higher order functions 1. INTRODUCTION In [Loulergue and Hains 1997] we have introduced the elements of an explicitly parallel functional language CDS : denotational semantics, operational semantics and full abstraction result. It is inspired by Berry and Curien s sequential language CDS [Berry and Curien 1985] but uses Brookes and Geva s generalized concrete data ....
....written fix(T ) and T 0 ffi T and have their usual meanings. All these syntactic forms are subject to the usual type constraints. 3. OPERATIONAL SEMANTICS We now define the formal operational semantics of CDS which is fully abstract with respect to the denotational semantics outlined above [Loulergue and Hains 1997]. The operational semantics manipulates memo terms, terms which memorize parts of their evaluation. A memo term is a CDS program term some of whose syntactic nodes are tagged with tables. Tables, initially empty, store current approximations of auxiliary states. For example, a ....
Loulergue, F. and Hains, G. 1997. Parallel functional programming with explicit processes: Beyond SPMD. In To appear in Euro-Par'97 (Passau, Germany, 1997).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC