Functional Active Objects: Typing and Formalisation - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Functional Active Objects: Typing and Formalisation


This paper provides a sound foundation for autonomous objects communicating by remote method invocations and futures. As a distributed extension of sigma-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 invocations. 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.
Fichier principal
Vignette du fichier
foclasa_aspfun.pdf (252.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00485759 , version 1 (21-05-2010)


  • HAL Id : hal-00485759 , version 1


Ludovic Henrio, Florian Kammüller. Functional Active Objects: Typing and Formalisation. Foundations of Coordination Languages and Software Architectures (FOCLASA'09), 2010, France. pp.83-101. ⟨hal-00485759⟩
162 View
107 Download


Gmail Facebook Twitter LinkedIn More