Type Theoretic Foundations For Concurrent Object Oriented Programing英文电子书.pdf

Type-Theoretic Foundations for Concurrent Object-Oriented Programing Naoki Kobayashi and Akinori Yonezawa Department of Information Science, University of Tokyo 7-3-l Hongo, Bunkyo-ku, Tokyo, 113 Japan Abstract Static type systems increase reliability and read- ability of programs, enhance code reuse by poly- A number of attempts have been made to ob- morphic typing, and also provide useful compil- tain type systems for object-oriented programming. ing information. Moreover, static type systems The view that lies common is “object-oriented pro- with type inference mechanisms can liberate pro- gramming = X-calculus + record.” Based on an grammers from the burden of writing complex analogous view “concurrent object-oriented pro- type declarations, hence programmers can benefit gramming = concurrent calculus + record,” we de- from such type systems without any additional ef- velop a static type system for concurrent object- forts compared with dynamically typed program- oriented programming. We choose our own Higher- ming languages. All the above arguments should Order ACL as a basic concurrent calculus, and also hold in concurrent object-oriented program- show that a concurrent object-oriented language ming. We argue that the above mentioned benefits