zbMATH — the first resource for mathematics

A semantics preserving actor translation. (English) Zbl 1401.68026
Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 369-378 (1997).
Summary: 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.
For the entire collection see [Zbl 1369.68020].

68N15 Theory of programming languages
68N18 Functional programming and lambda calculus
68N19 Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
68Q55 Semantics in the theory of computing
Full Text: DOI
[1] [Agh86]G. Agha. \(Actors: A Model of Concurrent Computation in Distributed Systems\). MIT Press, Cambridge, Mass., 1986.
[2] [Agh90]G. Agha. Concurrent object-oriented programming. \(Communications of the ACM\), 33(9):125-141, September 1990.
[3] [Ama94]R. M. Amadio. Translating core facile. Technical Report ECRC-1994-3, European Computer-Industry Research Centre, 1994.
[4] [AMST97]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. · Zbl 0870.68091
[5] [AP94]R. M. Amadio and S. Prasad. Localities and failures. Technical Report ECRC-1994-18, European Computer-Industry Research Centre, 1994. · Zbl 1044.68682
[6] [BB92]G. Berry and G. Boudol. The Chemical Abstract Machine. \(Theoretical Computer Science\), 96:217-248, 1992. · Zbl 0747.68013
[7] [BH77]Henry G. Baker and Carl Hewitt. Laws for communicating parallel processes. In \(IFIP Congress\), pages 987-992. IFIP, August 1977. · Zbl 0363.68077
[8] [Cli81]W.D.Clinger. Foundations of actor semantics. AI-TR-633, MIT Artificial Intelligence Laboratory, May 1981.
[9] [FF86]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.
[10] [Hew77]C. Hewitt. Viewing control structures as patterns of passing messages. \(Journal of Artificial Intelligence\), 8(3):323-364, 1977.
[11] [Mes92]J. Meseguer. Conditional rewriting logic as a unified model of concurrency. \(Theoretical Computer Science\), 96(1):73-155, 1992. · Zbl 0758.68043
[12] [Plo75]G. Plotkin. Call-by-name, call-by-value and the lambda calculus. \(Theoretical Computer Science\), 1:125-159, 1975. · Zbl 0325.68006
[13] [PT94]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.
[14] [Tal96a]C. L. Talcott. An actor rewriting theory. In \(Workshop on Rewriting Logic\), number 4 in Electronic Notes in Theoretical Computer Science, 1996. · Zbl 0912.68086
[15] [Tal96b]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.
[16] [Wal95]D. Walker. Objects in the \(π\)-calculus. \(Information and Computation\). 116:253-271, 1995.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.