Communicating sequential processes
Communicating sequential processes
Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Concurrent object-oriented programming
Communications of the ACM
A theory for program and data type specification
Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
A variable typed logic of effects
Information and Computation
Reasoning about functions with effects
Higher order operational techniques in semantics
The next 700 programming languages
Communications of the ACM
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Composable Semantic Models for Actor Theories
Higher-Order and Symbolic Computation
Actor theories in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Specification Diagrams for Actor Systems
Higher-Order and Symbolic Computation
Modular Reasoning for Actor Specification Diagrams
Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
SEMANTICS OF COMMUNICATING PARALLEL PROCESSES
SEMANTICS OF COMMUNICATING PARALLEL PROCESSES
Foundations of Actor Semantics
Foundations of Actor Semantics
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
A foundation for actor computation
Journal of Functional Programming
A universal modular ACTOR formalism for artificial intelligence
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Formalization in a logical theory can contribute to the foundational understanding of interactive systems in two ways. One is to provide language and principles for specification of and reasoning about such systems. The other is to better understand the distinction between sequential (turing equivalent) computation and interactive computation using techniques and results from recursion theory and proof theory. In this paper we briefly review the notion of interaction semantics for actor systems, and report on work in progress to formalize this interaction model. In particular we have shown that the set theoretic models of the formal interaction theory have greater recursion theoretic complexity than analogous models of theories of sequential computation, using a well-known result from recursion theory.