## Actor Languages: Their Syntax, Semantics, Translation, and Equivalence (1999)

Venue: | Theoretical Computer Science |

Citations: | 12 - 6 self |

### BibTeX

@ARTICLE{Mason99actorlanguages:,

author = {Ian A. Mason and Carolyn L. Talcott},

title = {Actor Languages: Their Syntax, Semantics, Translation, and Equivalence},

journal = {Theoretical Computer Science},

year = {1999},

volume = {228}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we present two actor languages and a semantics preserving translation between them. The source of the translation is a high-level language that provides object-based programming abstractions. The target is a simple functional language extended with basic primitives for actor computation. The semantics preserved is the interaction semantics of actor systems---sets of possible interactions of a system with its environment. The proof itself is of interest since it demonstrates a methodology based on the actor theory framework for reasoning about correctness of transformations and translations of actor programs and languages and more generally of concurrent object languages.

### Citations

1100 |
Actors: a model of concurrent computation in distributed systems
- Agha
- 1986
(Show Context)
Citation Context ...e transition relation on configurations derived from the reaction rules. A configuration can be thought of as representing a global snapshot of an actor system with respect to some idealized observer =-=[Agh86]-=-. It contains a set of receptionist names, a set of external actor names, and a collection of actors and messages. The sets of receptionist names and external actor names are the interface of an actor... |

475 |
Conditional rewriting logic as a unified model of concurrency
- Meseguer
- 1992
(Show Context)
Citation Context ...teriors are like solutions. Actor theories are in fact a special case of rewrite theories and the mechanisms we use to derive the computations of an actor system are based on those of rewriting logic =-=[Mes92]-=-. 2.2 Actor Theories Formally An actor theory, AT , is a structure of the following form: AT = h hA; S; M;Li; hacq ; bi; RR i A;S; M;L are the primitive sorts of AT . A is a countable set of actor nam... |

453 | The chemical abstract machine
- BERRY, BOUDOL
- 1990
(Show Context)
Citation Context ... mapping to a basic actor theory, or showing that the behavior described can be realized by an actor system. The term reaction rule is used here in the same spirit as in the Chemical Abstract Machine =-=[BB92]-=- to indicate local interactions of reactive entities. Actors and messages can be thought of as special kinds of molecules and interiors are like solutions. Actor theories are in fact a special case of... |

403 | Viewing control structures as patterns of passing messages - Hewitt - 1977 |

222 | A foundation for actor computation - Agha, Mason, et al. - 1997 |

170 |
Call-by-name, call-by-value and the lambda-calculus
- Plotkin
- 1975
(Show Context)
Citation Context ...ext filled with a redex. Reduction contexts identify the subexpression of an expression that is to be evaluated next, they correspond to the standard reduction strategy (left-first, call-by-value) of =-=[Plo75]-=- and were first introduced in [FF86]. An expression e is either a value or it can be decomposed uniquely into a reduction context filled with a redex. Thus, local actor computation is deterministic. D... |

159 | Concurrent Object-Oriented Programming - Agha - 1990 |

83 |
Control operators, the SECD machine and the -calculus
- Felleisen, Friedman
- 1986
(Show Context)
Citation Context ...ntexts identify the subexpression of an expression that is to be evaluated next, they correspond to the standard reduction strategy (left-first, call-by-value) of [Plo75] and were first introduced in =-=[FF86]-=-. An expression e is either a value or it can be decomposed uniquely into a reduction context filled with a redex. Thus, local actor computation is deterministic. Definition (V E rdx R): The set of va... |

82 | Rewriting Logic as a Semantic Framework of Concurrency: a Progress Report - Meseguer - 1996 |

74 | Concurrent objects in a process calculus
- Pierce, Turner
- 1994
(Show Context)
Citation Context ...stems, or more generally for distributed object-based systems. The main result of this paper is a proof of correctness of what is essentially a stage of compilation of a high-level actor language. In =-=[PT94]-=- high-level object programming constructs are explained by expansion in the Pict language. In [Wal95] a semantics for a variant of POOL is given via translation to a sorted Pi calculus. This is shown ... |

57 | for Communicating Parallel Processes - Hewitt, Baker - 1977 |

56 | Localities and failures
- AMADIO, PRASAD
- 1994
(Show Context)
Citation Context ...pressions. The converse is left open. The translation goes by an intermediate language obtained by adding a control operator to the asynchronous Facile much as we have done in the kernel language. In =-=[AP94]-=- an extension of the Pi-calculus to model locality and failure is translated in to a simply sorted Pi-calculus and similar properties are proved for the translation. Our approach differs in giving bot... |

56 |
Foundations of Actor Semantics
- Clinger
- 1981
(Show Context)
Citation Context ...ate that X belongs to the kernel language. So for example u K is an user language configuration. However to prevent a notational quagmire we use this convention sparingly. 3 behaviors used by Clinger =-=[Cli81]-=-. They are a simplification and generalization of the notion of abstract actor structures presented in [Tal96b, Tal96a]. 2.1 Actor Theories and Their Semantics-- an Introduction An actor theory descri... |

47 |
Objects in the calculus
- Walker
- 1995
(Show Context)
Citation Context ...oof of correctness of what is essentially a stage of compilation of a high-level actor language. In [PT94] high-level object programming constructs are explained by expansion in the Pict language. In =-=[Wal95]-=- a semantics for a variant of POOL is given via translation to a sorted Pi calculus. This is shown to be a simulation (up to bisimulation ) of a direct transition system operational semantics of POOL.... |

44 |
Interaction semantics for components of distributed systems
- Talcott
- 1996
(Show Context)
Citation Context ...ages since the details of the code describing an individual actors behavior are not visible outside that actor. All that needs to be common is the messages communicated among the different actors. In =-=[Tal96b]-=-, this intuition is formalized using the notion of an abstract actor structure. Here we generalize the notion of an abstract actor structure to an actor theory. Actor theories provide a general semant... |

31 | Composable semantic models for actor theories - Talcott - 1998 |

27 | An actor rewriting theory
- TALCOTT
- 1996
(Show Context)
Citation Context ... j; l )))) F(K ) = f 2 P(K ) Fair ()g 2.4 Interaction semantics The set of computation paths, P(K ), and the set of fair computation paths, F(K ) both give a compositional semantics for actor systems =-=[Tal96a]-=-. However these semantics contain too much detail about the inner workings of an actor system to yield a useful notion of equivalence (an equivalence is useful if equivalent entities cannot be disting... |

20 | Translating Core Facile
- Amadio
- 1994
(Show Context)
Citation Context ...he local computation. Rather than use a continuation passing transformation we add a control operation clc to the kernel language. This could eliminated by further application of the same ideas (c.f. =-=[Ama94]-=-). The main result presented here is that the translation, u2k preserves the interaction semantics. Theorem (u2k ): Isem( u P) = Isem(u2k ( u P))d u M where u P is a user language program, Isem maps p... |

3 |
A semantics preserving actor translation
- Mason, Talcott
- 1256
(Show Context)
Citation Context ... was kind enough to point out a fairness problem in an early version of the translation, while Scott Smith provided detailed corrections to an earlier draft. An early version of this paper appears as =-=[MT97]-=- and we thank the three anonymous ICALP referees and the three anonymous TCS referees for many helpful comments and corrections. This work was done while the first author was partially supported by Au... |