Type-theoretic foundations for concurrent object-oriented programing

Authors:
Naoki Kobayashi;Akinori Yonezawa
Affiliations:
Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113 Japan;Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113 Japan
Venue:
OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
Year:
1994

Citing 14
Cited 10

Actors: a model of concurrent computation in distributed systems

Actors: a model of concurrent computation in distributed systems
Linear logic

Theoretical Computer Science
Vulcan: logical concurrent objects

Concurrent Prolog: collected papers
ABCL: an object-oriented concurrent system

ABCL: an object-oriented concurrent system
Communication as fair distribution of knowledge

OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
A compilation method for ML-style polymorphic record calculi

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An efficient implementation scheme of concurrent object-oriented languages on stock multicomputers

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Safe type checking in a statically-typed object-oriented programming language

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACL—a concurrent linear logic programming paradigm

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Implementing Concurrent Object-Oriented Languages on Multicomputers

IEEE Parallel & Distributed Technology: Systems & Technology
Higher-Order Concurrent Linear Logic Programming

TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Typed Concurrent Objects

ECOOP '94 Proceedings of the 8th European Conference on Object-Oriented Programming
Principal Typing Schemes in a Polyadic pi-Calculus

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Typing System for a Calculus of Objects

Proceedings of the First JSSST International Symposium on Object Technologies for Advanced Software

Semantic-based visualization for parallel object-oriented programming

Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Linearity and the pi-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linearity and the pi-calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Flexible types for a concurrent model

Concurrent object-oriented programming and petri nets
Issues in formal methods

Formal methods for distributed processing
A specification logic for concurrent object-oriented programming

Mathematical Structures in Computer Science
Model checking linear logic specifications

Theory and Practice of Logic Programming
Types for Active Objects with Static Deadlock Prevention

Fundamenta Informaticae
State inference for dynamically changing interfaces

Computer Languages
Types for Active Objects with Static Deadlock Prevention

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract

A number of attempts have been made to obtain type systems for object-oriented programming. The view that lies common is “object-oriented programming = &lgr;-calculus + record.” Based on an analogous view “concurrent object-oriented programming = concurrent calculus + record,” we develop a static type system for concurrent object-oriented programming. We choose our own Higher-Order ACL as a basic concurrent calculus, and show that a concurrent object-oriented language can be easily encoded in the Higher-Order ACL extended with record operations. Since Higher-Order ACL has a strong type system with a polymorphic type inference mechanism, programs of the concurrent object-oriented language can be automatically type-checked by the encoding in Higher-Order ACL. Our approach can give clear accounts for complex mechanisms such as inheritance and method overriding within a simple framework.