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

This is the latest version of this item.

[img]
Preview
PDF
297kB

Official URL: http://dx.doi.org/10.1016/j.entcs.2009.10.026

This item is available in the Library Catalogue

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:Science & Technology > Science & Technology
ID Code:6851
Permissions granted by publisher:Post refereed version as permitted by publisher
Useful Links:
Deposited On:19 Jan 2011 15:22
Last Modified:04 Jun 2013 14:18

Available Versions of this Item

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

Repository Staff Only: item control page

Downloads

Downloads per month over past year