Functional active objects: typing and formalisation

Henrio, Ludovic and Kammueller, Florian (2009) Functional active objects: typing and formalisation. Electronic Notes in Theoretical Computer Science, 255 . pp. 83-101. ISSN 1571-0661 (doi:10.1016/j.entcs.2009.10.026)

Preview

PDF Download (297kB) | Preview

Abstract

This paper provides a sound foundation for autonomous objects communicating by remote method invo- cations and futures. As a distributed extension of ς-calculus, we define ASPfun, 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 ASPfun calculus and its semantics. Secondly we provide a type system for ASPfun, which guarantees the “progress” property. Most importantly, ASPfun 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.

Item Type:	Article
Additional Information:	Proceedings of the 8th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA 2009)
Research Areas:	A. > School of Science and Technology > Computer Science > Foundations of Computing group A. > School of Science and Technology > Computer Science > Artificial Intelligence group
Item ID:	6851
Notes on copyright:	Post refereed version as permitted by publisher
Useful Links:	Middlesex University Expert Profile
Depositing User:	Dr Florian Kammueller
Date Deposited:	19 Jan 2011 15:22
Last Modified:	25 May 2019 17:07
URI:	https://eprints.mdx.ac.uk/id/eprint/6851

Available Versions of this Item

• Functional active objects: typing and formalisation. (deposited 19 Jan 2011 15:22) [Currently Displayed]

Actions (login required)

Edit Item