ASPfun: a typed functional active object calculus
This is the latest version of this item.
- First submitted uncorrected version (with author's formatting)
This paper provides a sound foundation for autonomous objects communicating by remote method invocations 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 an object language enabling a concise representation of a set of active objects interacting by asynchronous method invocations. This paper first presents the ASPfun calculus and its semantics. Then, we provide a type system for ASPfun which guarantees the “progress” property. Most importantly, ASPfun 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.
|Keywords (uncontrolled):||Theorem proving; object calculus; futures; distribution; typing; binders|
|Research Areas:||A. > School of Science and Technology > Computer Science > Artificial Intelligence group
A. > School of Science and Technology > Computer Science > Foundations of Computing group
|Notes on copyright:||preprint as permitted by publisher.|
|Depositing User:||Dr Florian Kammueller|
|Date Deposited:||25 May 2012 11:05|
|Last Modified:||13 Oct 2016 14:24|
Available Versions of this Item
ASPfun: a typed functional active object calculus. (deposited 10 Jan 2011 13:24)
- ASPfun: a typed functional active object calculus. (deposited 25 May 2012 11:05) [Currently Displayed]
Actions (login required)