Hostname: page-component-f554764f5-qhdkw Total loading time: 0 Render date: 2025-04-20T01:34:54.710Z Has data issue: false hasContentIssue false
  • English
  • Français

A foundation for actor computation

Published online by Cambridge University Press:  01 January 1997

GUL A. AGHA ,
IAN A. MASON ,
SCOTT F. SMITH  and
CAROLYN L. TALCOTT
GUL A. AGHA
Affiliation:
University of Illinois at Urbana-Champaign, IL, USA (e-mail: [email protected])
IAN A. MASON
Affiliation:
University of New England, Armidale, NSW, Australia (e-mail: [email protected])
SCOTT F. SMITH
Affiliation:
The Johns Hopkins University, Baltimore, MD, USA (e-mail: [email protected])
CAROLYN L. TALCOTT
Affiliation:
Stanford University, Stanford, CA, USA (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We present an actor language which is an extension of a simple functional language, and provide an operational semantics for this extension. Actor configurations represent open distributed systems, by which we mean that the specification of an actor system explicitly takes into account the interface with external components. We study the composability of such systems. We define and study various notions of testing equivalence on actor expressions and configurations. The model we develop provides fairness. An important result is that the three forms of equivalence, namely, convex, must, and may equivalences, collapse to two in the presence of fairness. We further develop methods for proving laws of equivalence and provide example proofs to illustrate our methodology.

Type
Research Article
Information
Journal of Functional Programming , Volume 7 , Issue 1 , January 1997 , pp. 1 - 72
Copyright
© 1997 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.