N. Kobayashi and A. Yonezawa. Towards foundations for concurrent object-oriented programming -- types and language design. Theory and Practice of Object Systems, 1(4):243--268, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....or because it will never have the right method for the message. 2.1 Aims To ensure program safety, that is, the absence of run time errors, a popular approach is the use of a static type system. Traditional type systems assign rigid interface like types to the names of the objects [Mil93, VT93, KY95] We adopt a behaviours as types approach, such that a type is able to characterise all possible life cycles of an object, thus providing information about possible sequences of interactions. Types are terms of a process algebra, namely higher order labelled transition systems, which describe ....

Naoki Kobayashi and Akinori Yonezawa. Towards foundations of concurrent object-oriented programming|types and language design. Theory and Practice of Object Systems, 1(4), 1995. A preliminary summary appeared in Proceedings of ACM OOPSLA'94, pages 31-45, under the title Type-Theoretic Foundations for Concurrent Object-Oriented Programming.

....service availability. The notion of processes without errors is loosened, demanding only weak fairness in the treatment of messages. 1 Motivation The role of name passing process algebras in the study of the foundations of concurrent programming had been stressed by several authors (cf. [KY95, PT95]) The advantages of the object oriented paradigm are also well know, and there are several proposals of name passing calculus with such characteristics, as for example [Pie95] In all of them one can find a static type system enjoying the subject reduction property (invariance of a type under ....

....the future. The paper presents a type system that is able to type objects with a non uniform service availability, while preserving the subject reduction property. An extended and revised version of a paper presented at Euro Par 97. 1 A typical process not typable by traditional type systems [VH93, VT93, KY95, LW95] is a one place buffer that only allows read operations when it is full, and write operations when it is empty. Empty(b) b B [ write : u) Full(b u) Full(b u) b B [ read : r) r C val : u] j Empty(b) The type systems mentioned above assign interface like types to names. Therefore, name ....

N. Kobayashi and A. Yonezawa. Towards foundations of concurrent objectoriented programming -- types and language design. Theory and Practice of Object Systems, 1(4), 1995.

....cations of the behaviour of objects, able to cope with non uniform service availability. They are also suitable to specify protocols, like pop3, since a type can represent sequences of requests to a server. Traditional type systems assign rigid interface like types to the names of the objects [19, 31, 16]. With a more exible notion of error and with these richer types, we develop a type system that ensures safety properties resulting from the absence of persistent bad redexes, namely the absence of some deadlocks (that we call local) and the guarantee that typable processes will not run into ....

Naoki Kobayashi and Akinori Yonezawa. Towards foundations of concurrent object-oriented programming - types and language design. Theory and Practice of Object Systems, 1(4), 1995.

....accept a given message, either because the object is blocked, or because it will never have the right method for the message. Full version of the extended abstract published in the proceedings of Concur 00. 1 Traditional type systems assign rigid interface like types to the names of objects [17, 20, 33]. Take the example of a one place bu er that only allows read operations when it is full, and write operations when it is empty. We like to specify it as follows, showing clearly that the bu er alternates between write and read operations. def Empty(b) b fwrite(u) Full[b; u]g and Full(b; u) ....

Naoki Kobayashi and Akinori Yonezawa. Towards foundations of concurrent object-oriented programming|types and language design. Theory and Practice of Object Systems, 1(4), 1995.

....a state where it can accept the message. A communication error is a process with a persistent bad redex, either because the object is deadlocked, or because it will never have the right method for the message. Traditional type systems assign rigid interface like types to the names of the objects [6, 13, 18]. Type systems that support objects with non uniform interfaces, based on the distinct de nition of a run time protocol error discussed above, have been proposed for TyCO [15, 16] The systems ensure safety properties resulting from the absence of persistent bad redexes, namely the absence of some ....

N. Kobayashi and A. Yonezawa. Towards foundations of concurrent object-oriented programming - types and language design. Theory and Practice of Object Systems, 1(4), 1995.

....computation is performed by multiple concurrent processes communicating values along communication channels. Their computational models are simple but so expressive that various high level constructs for concurrent object oriented languages can be captured by process calculi extended with records[9, 11, 18]. Moreover, they provide us various useful methods to reason about behaviors of programs: criteria of behavioral equivalence of processes such as barbed bisimulation, or (static) type 1 systems. For these reasons, programming languages based on process calculi have the following advantages: ffl ....

N. Kobayashi and A. Yonezawa. Towards foundations for concurrent objectoriented programming -- types and language design --. Theory and Practice of Object Systems, 1(4):243--268, 1995.

....a state where it can accept the message. A communication error is a process with a persistent bad redex, either because the object is deadlocked, or because it will never have the right method for the message. Traditional type systems assign rigid interface like types to the names of the objects [13, 18, 6]. Type systems that support objects with non uniform interfaces, based on the distinct de nition of a run time protocol error discussed above, have been proposed for TyCO [15, 16] The systems ensure safety properties resulting from the absence of persistent bad redexes, namely the absence of some ....

N. Kobayashi and A. Yonezawa. Towards foundations of concurrent object-oriented programming|types and language design. Theory and Practice of Object Systems, 1(4), 1995.

....availability of objects. The notion of processes without errors is loosened, demanding only weak fairness in the treatment of messages. 1 Motivation The role of name passing process algebras in the study of the foundations of concurrent programming had been stressed by several authors (c.f. [KY95, PT95]) The advantages of the object oriented paradigm are also well know, and there are several proposals of name passing calculus with such characteristics, as for example [Pie95] In all of them one can find a static type system enjoying the subject reduction property (invariance of a type under ....

....in the future. The paper presents a type system that is able to type objects with a non uniform service availability, while preserving the subject reduction property. This is a full version of a paper to appear in Euro Par 97. A typical process not typable by traditional type systems [VH93, VT93, KY95, LW95] is a one place buffer that only allows read operations when it is full, and write operations when it is empty. Empty(b) b B [ write : u) Full(b u) Full(b u) b B [ read : r) r C val : u] j Empty(b) The type systems mentioned above assign interface like types to names. Therefore, name b ....

N. Kobayashi and A. Yonezawa. Towards foundations of concurrent objectoriented programming - types and language design. Theory and Practice of Object Systems, 1(4), 1995.

....(representing objects as state transition systems) and demand weak fairness in the treatment of messages. The type system is able to type objects with a non uniform service availability, while preserving the subject reduction property. A typical process not typable by traditional type systems [VH93, VT93, KY95, LW95] is a one place buffer that only allows read operations when it is full, and write operations when it is empty. Empty(b) b B [ write : u) Full(b u) Full(b u) b B [ read : r) r C val : u] j Empty(b) The type systems mentioned above assign interface like types to names. Therefore, name b ....

N. Kobayashi and A. Yonezawa. Towards foundations of concurrent objectoriented programming - types and language design. Theory and Practice of Object Systems, 1(4), 1995.

No context found.

N. Kobayashi and A. Yonezawa. Towards foundations for concurrent object-oriented programming -- types and language design. Theory and Practice of Object Systems, 1(4):243--268, 1995.

No context found.

N. Kobayashi and A. Yonezawa. Towards foundations for concurrent objectoriented programming -- types and language design. Theory and Practice of Object Systems, 1(4):243--268, 1995.

No context found.

Naoki Kobayashi and Akinori Yonezawa. Towards foundations for concurrent object-oriented programming -- types and language design. Theory and Practice of Object Systems, 1(4):243-- 268, 1995.

No context found.

Naoki Kobayashi and Akinori Yonezawa. Towards foundations for concurrent object-oriented programming -- types and language design --. Theory and Practice of Object Systems, John Wiley & Sons, 1995. to appear.

No context found.

N. Kobayashi and A. Yonezawa. Towards foundations for concurrent object-oriented programming -- types and language design. Theory and Practice of Object Systems, 1(4):243--268, 1995.

No context found.

N. Kobayashi and A. Yonezawa. Towards foundations for concurrent object-oriented programming -- types and language design. Theory and Practice of Object Systems, 1(4):243--268, 1995.

....getx, gety and set. Sending a message other than getx, gety and set is statically detected as an invalid field extraction from the record self. 14 id. point (1.0, 2.0) id #move id (1.0, 1. 0) create a point object and send to it a move message ) Type Mismatch on Variable id In [13][11], we describe more extensively how statically typed concurrent objectoriented programming languages which support various mechanisms such as inheritance, method overriding, and method access control, can be realized on top of HACL. 4 Refinement of The Basic Type System Since the basic type ....

Kobayashi, N., and A. Yonezawa, "Towards Foundations for Concurrent ObjectOriented Programming -- Types and Language Design." submitted.

....Rep91] as foundations for theoretical study of language features like concurrent objects (e.g. Jon93, Wal95, A revised and extended version of the paper presented at 23rd ACM SIGPAN SIGACT Symposium on Principles of Programming Languages (POPL96) pp. 358 371, 1996. HT91, Vas94, KY94, KY95] and more recently as core programming languages in their own right [PT95, PT97, FG96, FGL 96] The small set of message passing primitives used by the pi calculus makes it attractive both as an object of theoretical study and as a basis for language design and implementation. However, such ....

....of compiler optimizations. The impact of these optimizations in practice is not yet clear, but work is underway on evaluating several in compilers for a linear variant of Pict, a programming language based on the pi calculus [PT95, PT97] and for a concurrent linear logic programming language HACL [KY95, IK97] whose core language is close to the pi calculus. For example, the implementation of communication on a linear channel can be simplified, since a linear channel can only be in one of two states when a communication occurs: there may be either zero or one processes of each polarity waiting ....

Naoki Kobayashi and Akinori Yonezawa. Towards foundations for concurrent object-oriented programming -- types and language design --. Theory and Practice of Object Systems, 1(4):243--268, 1995.

.... channels for short) communication along those channels, and concurrent execution of processes which have recently been studied extensively through process calculi [12, 20, 16, 4, 8] They have been found to be expressive enough to provide higher level mechanisms such as concurrent objects [9, 17]. On the other hand, such concurrency primitives are too powerful and low level, and they suffer from serious problems: deadlock and nondeterminism. They often make it difficult to debug programs and to think about program behavior. For example, if we extend a functional programming language with ....

Naoki Kobayashi and Akinori Yonezawa. Towards foundations for concurrent objectoriented programming -- types and language design --. Theory and Practice of Object Systems, 1(4):243--268, 1995.

.... immediate applications in specification and verification of concurrent systems, these calculi have been used as the basis for concurrency features in numerous programming languages (e.g. Car86, GMP89, Rep91] as foundations for theoretical study of language features like concurrent objects (e.g. [Jon93, Wal95, HT91, Vas94, KY94, KY95]) and more recently as core programming languages in their own right [PT95a, PT95b, FG96] The small set of message passing primitives used by the pi calculus makes it attractive both as an object of theoretical study and as a basis for language design and implementation. However, such generality ....

Naoki Kobayashi and Akinori Yonezawa. Towards foundations for concurrent object-oriented programming -- types and language design --. Theory and Practice of Object Systems, John Wiley & Sons, 1995. to appear.

....(HACL) for presenting our static analysis technique. HACL is theoretically clear and provides powerful programming models such as higher order concurrent programming. 1 Since many concurrent programming languages including concurrent object oriented languages can be naturally embedded in HACL[7][4], the techniques proposed here are easily applied to such languages. As far as the author knows, this is the first formal static analysis technique applicable to concurrent object oriented languages. The rest of this paper is organized as follows. Section 2 introduces the syntax and the basic type ....

Kobayashi, N., and A. Yonezawa, "Towards Foundations for Concurrent Object-Oriented Programming -- Types and Language Design." submitted.

No context found.

Naoki Kobayashi and Aki Yonezawa. Towards foundations for concurrent object-oriented programming --- Types and language design. Submitted for publication, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC