MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Types and programming languages
Types and programming languages
A Theory of Objects
Compilation and Equivalence of Imperative Objects
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Asynchronous and deterministic objects
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
OOPSLA '05 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
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)
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Prototyping Concurrent Systems with Agents and Artifacts: Framework and Core Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A universal modular ACTOR formalism for artificial intelligence
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
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
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Privacy enforcement and analysis for functional active objects
DPM'10/SETOP'10 Proceedings of the 5th international Workshop on data privacy management, and 3rd international conference on Autonomous spontaneous security
ASPfun: A typed functional active object calculus
Science of Computer Programming
| Hi-index | 0.00 |
This paper provides a sound foundation for autonomous objects communicating by remote method invo- cations and futures. As a distributed extension of @z-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 a well structured distributed object language enabling a concise representation of asynchronous method invoca- tions. This paper first presents the ASP"f"u"n calculus and its semantics. Secondly we provide a type system for ASP"f"u"n, which guarantees the ''progress'' property. Most importantly, ASP"f"u"n and its properties have been formalised and proved using the Isabelle theorem prover, and we consider it as a good step toward formalisation of distributed languages.