## found at the ENTCS Macro Home Page. Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures (2007)

### BibTeX

@MISC{07foundat,

author = {},

title = {found at the ENTCS Macro Home Page. Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures},

year = {2007}

}

### OpenURL

### Abstract

Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be

### Citations

587 |
Communicating and Mobile Systems: the π-Calculus
- Milner
- 1999
(Show Context)
Citation Context ...Sabel, Schmidt-Schauß, Schwinghammer inria-00128861, version 1 - 7 Mar 2007 [6], λ(fut)’s reference cells permit to express synchronization constructs, such as channels of the asynchronous π-calculus =-=[9]-=-, JoCaml-like joins [4], and streams. In this paper we present an observational semantics for λ(fut) that is needed for reasoning about concurrent programs and program transformations. The result is a... |

434 |
The π-calculus: a Theory of Mobile Processes
- Sangiorgi, Walker
- 2001
(Show Context)
Citation Context ...ough reference cells, and sharing, a combination which is not handled by semantical models built upon powerdomains. Most previous work on semantics for concurrent languages focuses on process calculi =-=[9,19]-=- or investigates the theory obtained by encoding lambda calculi into process calculus (for instance, [18]). In [5,7], program behavior in fragments of Concurrent ML is characterized by bisimilarity wi... |

293 | The Oz Programming Model
- Smolka
- 1995
(Show Context)
Citation Context ...roduction The λ calculus λ(fut) [12] models the operational semantics of the core of Alice ML [16], a recent concurrent higher-order programming language of the ML family [10,3] inspired by Mozart-Oz =-=[20]-=-. Alice ML provides typed functional programming with mixed concurrent eager and lazy threads which may be distributed transparently over the network. In Alice ML, futures form a (light-weight) concur... |

212 | A Powerdomain Construction
- Plotkin
- 1976
(Show Context)
Citation Context ... λ(fut) inria-00128861, version 1 - 7 Mar 2007 count. Contextual equivalence as a combination of may- and must-convergence is also known from the use of convex powerdomains in domain-theoretic models =-=[14]-=-. However, observational semantics provides a powerful and also practically useful semantics with a maximum of equations in the presence of lambda abstractions, concurrency and synchronization, dynami... |

74 | The incremental garbage collection of processes
- Hewitt
- 1977
(Show Context)
Citation Context ...while others require proper values (so they have to wait until the required futures get bound to proper values). This way, futures lead to a convenient form of (automatic) data-driven synchronization =-=[1]-=-. In contrast to previous purely functional λ-calculi with futures c○2007 Published by Elsevier Science B. V.Niehren, Sabel, Schmidt-Schauß, Schwinghammer inria-00128861, version 1 - 7 Mar 2007 [6], ... |

53 | The lazy lambda calculus in a concurrency scenario
- Sangiorgi
- 1994
(Show Context)
Citation Context ...domains. Most previous work on semantics for concurrent languages focuses on process calculi [9,19] or investigates the theory obtained by encoding lambda calculi into process calculus (for instance, =-=[18]-=-). In [5,7], program behavior in fragments of Concurrent ML is characterized by bisimilarity with respect to a labelled transition system. Plan. We recall λ(fut) in Section 2 and adapt it by sharing c... |

40 | Jocaml: mobile agents for Objective-Caml
- Conchon, Fessant
- 1999
(Show Context)
Citation Context ...Schwinghammer inria-00128861, version 1 - 7 Mar 2007 [6], λ(fut)’s reference cells permit to express synchronization constructs, such as channels of the asynchronous π-calculus [9], JoCaml-like joins =-=[4]-=-, and streams. In this paper we present an observational semantics for λ(fut) that is needed for reasoning about concurrent programs and program transformations. The result is a powerful notion of pro... |

34 | Operational Semantics and Program Equivalence - Pitts - 2000 |

27 |
The semantics of future and an application
- Flanagan, Felleisen
- 1999
(Show Context)
Citation Context ...n [1]. In contrast to previous purely functional λ-calculi with futures c○2007 Published by Elsevier Science B. V.Niehren, Sabel, Schmidt-Schauß, Schwinghammer inria-00128861, version 1 - 7 Mar 2007 =-=[6]-=-, λ(fut)’s reference cells permit to express synchronization constructs, such as channels of the asynchronous π-calculus [9], JoCaml-like joins [4], and streams. In this paper we present an observatio... |

19 | A theory of bisimulation for a fragment of concurrent ML with local names, Theoret
- Jeffrey, Rathke
(Show Context)
Citation Context ...ost previous work on semantics for concurrent languages focuses on process calculi [9,19] or investigates the theory obtained by encoding lambda calculi into process calculus (for instance, [18]). In =-=[5,7]-=-, program behavior in fragments of Concurrent ML is characterized by bisimilarity with respect to a labelled transition system. Plan. We recall λ(fut) in Section 2 and adapt it by sharing call-by-valu... |

19 | G.: Alice through the looking glass
- Rossberg, Botlan, et al.
- 2004
(Show Context)
Citation Context ...r, call-by-value β-reduction. Keywords: Concurrent programming languages, lambda calculus, semantics 1 Introduction The λ calculus λ(fut) [12] models the operational semantics of the core of Alice ML =-=[16]-=-, a recent concurrent higher-order programming language of the ML family [10,3] inspired by Mozart-Oz [20]. Alice ML provides typed functional programming with mixed concurrent eager and lazy threads ... |

14 | A nondeterministic call-by-need lambda calculus
- Kutzner, Schmidt-Schauß
(Show Context)
Citation Context ...formations, and present a non-trivial example for optimization (Subsection 4.5). The main tools in proving equivalences, besides the context lemma, are complete sets of forking and commuting diagrams =-=[8,17]-=-. Related work. Notions of program equivalence for deterministic languages with reference cells based on contextual equivalence, as e.g. considered in [13], have to be extended and adapted to take non... |

14 | A call-by-need lambda-calculus with locally bottom-avoiding choice: Context lemma and correctness of transformations
- Sabel, Schmidt-Schauß
- 2008
(Show Context)
Citation Context ...rough several indirections. Since the calculus is non-deterministic, we introduce notions of may- and mustconvergence in a third step, a modelling technique used previously for lambdacalculi with amb =-=[2,11,17]-=-. We call a process may-convergent if it may terminate successfully, and must-convergent, if all its reduction descendants must always remain may-convergent. This notion of must-convergence is appropr... |

13 | The missing link – dynamic components for ML
- Rossberg
(Show Context)
Citation Context ...rent eager and lazy threads which may be distributed transparently over the network. In Alice ML, futures form a (light-weight) concurrency primitive, and implement lazy loading of program components =-=[15]-=-. Formally, λ(fut) is a call-by-value λ-calculus with reference cells and concurrent threads that synchronize on futures. Futures are like logic variables with restricted read and write access. Succes... |

11 |
A concurrent lambda calculus with futures. Theor. Comput. Sci., 364. and Livelocks in Concurrent Objects with Futures 25
- Niehren, Schwinghammer, et al.
- 2006
(Show Context)
Citation Context ...es all of λ(fut)’s deterministic reduction rules, in particular, call-by-value β-reduction. Keywords: Concurrent programming languages, lambda calculus, semantics 1 Introduction The λ calculus λ(fut) =-=[12]-=- models the operational semantics of the core of Alice ML [16], a recent concurrent higher-order programming language of the ML family [10,3] inspired by Mozart-Oz [20]. Alice ML provides typed functi... |

7 |
Developing Applications with Objective Caml. O’Reilly
- Chailloux, Emmanuel, et al.
- 2000
(Show Context)
Citation Context ...bda calculus, semantics 1 Introduction The λ calculus λ(fut) [12] models the operational semantics of the core of Alice ML [16], a recent concurrent higher-order programming language of the ML family =-=[10,3]-=- inspired by Mozart-Oz [20]. Alice ML provides typed functional programming with mixed concurrent eager and lazy threads which may be distributed transparently over the network. In Alice ML, futures f... |

3 |
On the representation of McCarthy’s amb in the pi-calculus.” Theoret
- Carayol, Hirschkoff, et al.
- 2005
(Show Context)
Citation Context ...rough several indirections. Since the calculus is non-deterministic, we introduce notions of may- and mustconvergence in a third step, a modelling technique used previously for lambdacalculi with amb =-=[2,11,17]-=-. We call a process may-convergent if it may terminate successfully, and must-convergent, if all its reduction descendants must always remain may-convergent. This notion of must-convergence is appropr... |

3 |
A theory of weak bisimulation for
- Ferreira, Hennessy, et al.
- 1998
(Show Context)
Citation Context ...ost previous work on semantics for concurrent languages focuses on process calculi [9,19] or investigates the theory obtained by encoding lambda calculi into process calculus (for instance, [18]). In =-=[5,7]-=-, program behavior in fragments of Concurrent ML is characterized by bisimilarity with respect to a labelled transition system. Plan. We recall λ(fut) in Section 2 and adapt it by sharing call-by-valu... |

2 |
McCarthy’s Amb
- Moran, “Call-by-name
- 1998
(Show Context)
Citation Context ...rough several indirections. Since the calculus is non-deterministic, we introduce notions of may- and mustconvergence in a third step, a modelling technique used previously for lambdacalculi with amb =-=[2,11,17]-=-. We call a process may-convergent if it may terminate successfully, and must-convergent, if all its reduction descendants must always remain may-convergent. This notion of must-convergence is appropr... |