MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Modelling and programming in an object-oriented concurrent language ABCL/1
Object-oriented concurrent programming
A language with distributed scope
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An overview of actor languages
OOPWORK '86 Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming
&pgr;-calculus in (Co)inductive-type theory
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Types and programming languages
Types and programming languages
A Theory of Objects
Safe Dynamic Binding in the Join Calculus
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Mobile objects "must" move safely
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Asynchronous and deterministic objects
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of Functional Programming
The semantics of future and an application
Journal of Functional Programming
A foundation for actor computation
Journal of Functional Programming
A Theory of Distributed Objects
A Theory of Distributed Objects
A concurrent lambda calculus with futures
Theoretical Computer Science - Applied semantics
Creol: a type-safe object-oriented model for distributed concurrent systems
Theoretical Computer Science - Components and objects
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Journal of Automated Reasoning
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Psi-calculi: Mobile Processes, Nominal Data, and Logic
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
A universal modular ACTOR formalism for artificial intelligence
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Functional Active Objects: Typing and Formalisation
Electronic Notes in Theoretical Computer Science (ENTCS)
Transparent First-class Futures and Distributed Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Formalising the π-calculus using nominal logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A complete guide to the future
ESOP'07 Proceedings of the 16th European conference on Programming
A mechanized model of the theory of objects
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Operational reasoning for concurrent caml programs and weak memory models
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Implementing Privacy with Erlang Active Objects
ICIMP '10 Proceedings of the 2010 Fifth International Conference on Internet Monitoring and Protection
simpA: An agent-oriented approach for programming concurrent applications on top of Java
Science of Computer Programming
Ambient-Oriented programming in ambienttalk
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
Hi-index | 0.00 |
This paper provides a sound foundation for autonomous objects communicating by remote method invocations and futures. As a distributed extension of @s-calculus we define ASP"f"u"n, a calculus of functional objects, behaving autonomously and communicating by a request-reply mechanism: requests are method calls handled asynchronously and futures represent awaited results for requests. This results in an object language enabling a concise representation of a set of active objects interacting by asynchronous method invocations. This paper first presents the ASP"f"u"n calculus and its semantics. Then, we provide a type system for ASP"f"u"n which guarantees the ''progress'' property. Most importantly, ASP"f"u"n has been formalised; its properties have been formalised and proved using the Isabelle theorem prover and we consider this as an important step in the formalization of distributed languages. This work was also an opportunity to study different binder representations and experiment with two of them in the Isabelle/HOL theorem prover.