Dealing Denotationally With Stream-based Communication

We define a denotational semantics for a kernel-calculus of the parallel functional language Eden. We choose continuations to deal with side-effects (process creation and communication) in a lazy context. The calculus includes streams for communication, and their modelization by a denotational semantics is not direct because a stream may be infinite.

[1]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[2]  Mark B. Josephs,et al.  The Semantics of Lazy Functional Languages , 1989, Theor. Comput. Sci..

[3]  Peyton Jones,et al.  Haskell 98 language and libraries : the revised report , 2003 .

[4]  Yolanda Ortega-Mallén,et al.  Continutation Semantics for Parallel Haskell Dialects , 2003, APLAS.

[5]  John H. Reppy Concurrent ML: Design, Application and Semantics , 1993, Functional Programming, Concurrency, Simulation and Automated Reasoning.

[6]  Clara Segura,et al.  Optimising Eden by transformation , 2000, Scottish Functional Programming Workshop.

[7]  Robert D. Tennent,et al.  The denotational semantics of programming languages , 1976, CACM.

[8]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[9]  John Launchbury,et al.  A natural semantics for lazy evaluation , 1993, POPL '93.

[10]  Sergei Gorlatch,et al.  Send-receive considered harmful: Myths and realities of message passing , 2004, TOPL.

[11]  Yolanda Ortega-Mallén,et al.  An Operational Semantics for the Parallel Language Eden , 2002, Parallel Process. Lett..

[12]  Rita Loogen,et al.  Under Consideration for Publication in J. Functional Programming Parallel Functional Programming in Eden , 2022 .

[13]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[14]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[15]  Clara Segura,et al.  Deriving Non-Hierarchical Process Topologies , 2001, Scottish Functional Programming Workshop.