WEKO3
アイテム
Recursive Types in a Calculus of Objects
https://ipsj.ixsq.nii.ac.jp/records/14143
https://ipsj.ixsq.nii.ac.jp/records/14143ad928855-a4e1-49c7-a5f5-11e7dd587f66
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL3509017.pdf (772.6 kB)
|
Copyright (c) 1994 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1994-09-15 | |||||||
| タイトル | ||||||||
| タイトル | Recursive Types in a Calculus of Objects | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Recursive Types in a Calculus of Objects | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 論文 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| その他タイトル | ||||||||
| その他のタイトル | プログラミング言語および処理系 | |||||||
| 著者所属 | ||||||||
| Department of Computer Science Keio University Japan | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science, Keio University, Japan | ||||||||
| 著者名 |
VascoThudichumVasconcelos
× VascoThudichumVasconcelos
|
|||||||
| 著者名(英) |
Vasco, ThudichumVasconcelos
× Vasco, ThudichumVasconcelos
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | We introduce a name-passing calculus featuring objects as guarded labelled-sums 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 l-calculus and of Vasconcelos and Honda for the polyadic p-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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | We introduce a name-passing calculus featuring objects as guarded labelled-sums, 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 l-calculus, and of Vasconcelos and Honda for the polyadic p-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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN00116647 | |||||||
| 書誌情報 |
情報処理学会論文誌 巻 35, 号 9, p. 1828-1836, 発行日 1994-09-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7764 | |||||||
