Recursive Types in a Calculus of Objects

スポンサーリンク

概要

• 論文の詳細を見る

• We introduce a name-passing calculus featuring objects as guarded labelled-sums, each summand repres enting 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 give 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.

• 一般社団法人情報処理学会の論文
• 1994-09-15

著者

• Vasconcelos Vasco

  Department Of Computer Science Keio University

関連論文

• Recursive Types in a Calculus of Objects

スポンサーリンク