Recursive types in a calculus of objects (1993) [3 citations — 3 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@TECHREPORT{Vasconcelos93recursivetypes,author = {Vasco Thudichum Vasconcelos},
title = {Recursive types in a calculus of objects},
institution = {Transactions of Information Processing Society of Japan},
year = {1993}
}
Years of Citing Articles
Abstract:
We introduce a name-passing calculus featuring objects as guarded labelledsums, each summand representing a method, and asynchronous labelled messages selecting a branch in the sum. A decidable type assignment system allows to statically verify whether all possible communications in a given program are secure, in the precise sense that no object will ever receive a message for which it does not have an appropriate method. Then we present a recursive type system based on that of Cardone and Coppo for the-calculus, and of Vasconcelos and Honda for the polyadic-calculus. The new system extends the class of typable terms while preserving basic syntactical properties of the simple type system, including subject-reduction and existence and computability of principal typings.
