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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Agha. Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge, Mass., 1986.
G. Agha. Concurrent object-oriented programming. Communications of the ACM, 33(9):125–141, September 1990.
R. M. Amadio. Translating core facile. Technical Report ECRC-1994-3, European Computer-Industry Research Centre, 1994.
G. Agha, I. A. Mason, S. F. Smith, and C. L. Talcott. A foundation for actor computation. Journal of Functional Programming, 7:1–72, 1997.
R. M. Amadio and S. Prasad. Localities and failures. Technical Report ECRC-1994-18, European Computer-Industry Research Centre, 1994.
G. Berry and G. Boudol. The Chemical Abstract Machine. Theoretical Computer Science, 96:217–248, 1992.
Henry G. Baker and Carl Hewitt. Laws for communicating parallel processes. In IFIP Congress, pages 987–992. IFIP, August 1977.
W.D.Clinger. Foundations of actor semantics. AI-TR-633, MIT Artificial Intelligence Laboratory, May 1981.
M. Felleisen and D.P. Friedman. Control operators, the SECD-machine, and the λ-calculus. In M. Wirsing, editor, Formal Description of Programming Concepts III, pages 193–217. North-Holland, 1986.
C. Hewitt. Viewing control structures as patterns of passing messages. Journal of Artificial Intelligence, 8(3):323–364, 1977.
J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73–155, 1992.
G. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125–159, 1975.
Benjamin C. Pierce and David N. Turner. Concurrent objects in a process calculus. In Theory and Practice of Parallel Programming (TPPP), Sendai, Japan, Lecture Notes in Computer Science. Springer-Verlag, November 1994. To appear, 1995.
C. L. Talcott. An actor rewriting theory. In Workshop on Rewriting Logic, number 4 in Electronic Notes in Theoretical Computer Science, 1996.
C. L. Talcott. Interaction semantics for components of distributed systems. In E. Najm and J-B. Stefani, editors, 1st IFIP Workshop on Formal Methods for Open Object-based Distributed Systems, FMOODS'96, 1996. proceedings published in 1997 by Chapman&Hall.
D. Walker. Objects in the π-calculus. Information and Computation. 116:253–271, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mason, I.A., Talcott, C.L. (1997). A semantics preserving actor translation. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_193
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_193
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive