We present an actor language which is an extension of a simple functional language, and provide a precise operational semantics for this extension. Actor configurations are open distributed systems, meaning we explicitly take into account the interface with external components in the specification of an actor system. We define and study various notions of equivalence on actor expressions and configurations.
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
2677
|
Communicating Sequential Processes
– Hoare
- 1978
|
|
865
|
ACTORS, a model of concurrent computation in distributed systems
– Agha
- 1986
|
|
556
|
Structure and interpretation of computer programs
– Abelson, Sussman, et al.
- 1996
|
|
410
|
A language with distributed scope
– Cardelli
- 1995
|
|
393
|
A syntactic approach to type soundness
– Wright, Felleisen
- 1994
|
|
390
|
PVS: A prototype verification system
– Owre, Shankar, et al.
- 1992
|
|
368
|
Conditional rewriting logic as a unified model of concurrency
– Meseguer
- 1992
|
|
354
|
Computational Lambda-Calculus and Monads
– Moggi
- 1989
|
|
339
|
Testing equivalences for processes
– Nicola, Hennessy
- 1984
|
|
299
|
Control structure as patterns of passing messages
– Hewitt
- 1979
|
|
283
|
An Object Calculus for Asynchronous Communication
– Honda, Tokoro
- 1991
|
|
257
|
The mechanical evaluation of expressions
– Landin
- 1964
|
|
245
|
Calculi for Synchrony and Asynchrony
– Milner
- 1983
|
|
232
|
Models for concurrency
– Winskel, Nielsen
- 1994
|
|
230
|
Trace Theory for Automatic Hierarchical Veri cation of Speedindependent Circuits
– Dill
- 1989
|
|
204
|
The revised report on the syntactic theories of sequential control and state
– Felleisen, Hieb
- 1992
|
|
136
|
Concurrent Object-Oriented Programming
– Agha
- 1990
|
|
131
|
Call-by-name, call-by-value, and the lambda calculus
– Plotkin
- 1975
|
|
126
|
Lambda-Calculus Models of Programming Languages
– Morris
- 1968
|
|
125
|
FACILE, a symmetric integration of concurrent and functional programming
– Giacalone, Mishra, et al.
- 1989
|
|
119
|
Higher-order concurrency
– Reppy
- 1992
|
|
102
|
A domain equation for bisimulation
– Abramsky
- 1991
|
|
91
|
Control operators, the SECD machine, and the -calculus
– Felleisen, Friedman
- 1986
|
|
89
|
Equivalence in functional languages with effects
– Mason, Talcott
- 1991
|
|
85
|
A calculus of mobile processes, parts I and II
– Milner, Parrow, et al.
- 1989
|
|
78
|
Concurrent objects in a process calculus
– Pierce, Turner
- 1994
|
|
76
|
A semantics for ML concurrency primitives
– Berry, Milner, et al.
- 1992
|
|
76
|
A theory of primitive objects: Untyped and first–order systems
– Abadi, Cardelli
- 1994
|
|
68
|
Concurrent Programming in Erlang
– Armstrong, Virding, et al.
- 1996
|
|
65
|
The scientific community metaphor
– Kornfeld, Hewitt
- 1981
|
|
61
|
Abstraction and Modularity Mechanisms for Concurrent Computing
– Agha, Frølund, et al.
- 1993
|
|
54
|
Foundations of Actor Semantics
– Clinger
- 1981
|
|
53
|
Towards a Theory of Actor Computation
– Agha, Mason, et al.
- 1992
|
|
53
|
Fully abstract models of typed *-calculi
– Milner
- 1977
|
|
51
|
Description and theoretical analysis (using schemata) of PLANNER: a language for proving theorems and manipulating models in a robot
– Hewitt
- 1972
|
|
50
|
Laws for Communicating Parallel Processes
– Baker, Hewitt
- 1977
|
|
49
|
Rewriting as a unified model of concurrency
– Meseguer
- 1990
|
|
47
|
Concurrent object-oriented programming in Act 1
– Lieberman
- 1987
|
|
23
|
Translating Core Facile
– Amadio
- 1994
|
|
23
|
Semantics of Communicating Parallel Processes
– Greif
- 1975
|
|
16
|
Specification and proof techniques for serializers
– Hewitt, Atkinson
- 1979
|
|
14
|
Acore: The design of a core actor language and its compiler
– Manning
- 1987
|
|
14
|
An operational semantics of first-class synchronous operations
– Reppy
- 1991
|
|
13
|
Synchronization in actor systems
– Atkinson, Hewitt
- 1977
|
|
8
|
Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming
– Prasad, Giacalone, et al.
- 1990
|
|
6
|
Call-by-name, call-by-value and the lambda-v-calculus
– Plotkin
- 1975
|
|
5
|
Combinators and Functional Programming Languages
– Cardelli
- 1985
|
|
3
|
Process Algebra: Specification and Verification
– Bergstra, Klop
- 1986
|
|
3
|
Reasoning about object systems
– Mason, Talcott
- 1994
|
|
