Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleOctober 1998
Software reuse (panel): nemesis or nirvana?
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 417–420https://doi.org/10.1145/286936.286982Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Contraint-based polymorphism in Cecil: towards a practical and static type system
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 388–411https://doi.org/10.1145/286936.286979We present a static type system for object-oriented languages which strives to provide static typechecking without resorting to dynamic "type casts," restricting what code the programmer can write, or being too verbose or difficult to use in practice. ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Multiple dispatch as dispatch on Tuples
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 374–387https://doi.org/10.1145/286936.286977Many popular object-oriented programming languages, such as C++, Smalltalk-80, Java, and Eiffel, do not support multiple dispatch. Yet without multiple dispatch, programmers find it difficult to express binary methods and design patterns such as the "...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Compound types for Java
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 362–373https://doi.org/10.1145/286936.286975Type compatibility can be defined based on name equivalence, that is, explicit declarations, or on structural matching. We argue that component software has demands for both. For types expressing individual contracts, name equivalence should be used so ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
What is Java binary compatibility?
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 341–361https://doi.org/10.1145/286936.286974Separate compilation allows the decomposition of programs into units that may be compiled separately, and linked into an executable. Traditionally, separate compilation was equivalent to the compilation of all units together, and modification and re-...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 -
- ArticleOctober 1998
Reasoning about Java classes: preliminary report
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 329–340https://doi.org/10.1145/286936.286973We present the first results of a project called LOOP, on formal methods for the object-oriented language Java. It aims at verification of program properties, with support of modern tools. We use our own front-end tool (which is still partly under ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
A type system for object initialization in the Java bytecode language
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 310–327https://doi.org/10.1145/286936.286972In the standard Java implementation, a Java language program is compiled to Java bytecode. This bytecode may be sent across the network to another site, where it is then interpreted by the Java Virtual Machine. Since bytecode may be written by hand, or ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Lightweight object-oriented shared variables for distributed applications on the Internet
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 296–309https://doi.org/10.1145/286936.286969This paper describes a lightweight yet powerful approach for writing distributed applications using shared variables. Our approach, called SHAREHOLDER, is inspired by the flexible and intuitive model of information access common to the World Wide Web. ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Object lessons learned from a distributed system for remote building monitoring and operation
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 284–295https://doi.org/10.1145/286936.286968In this paper we describe our experiences with the design, the deployment, and the initial operation of a distributed system for the remote monitoring and operation of multiple heterogeneous commercial buildings across the Internet from a single control ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Visualizing dynamic software system information through high-level models
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 271–283https://doi.org/10.1145/286936.286966Dynamic information collected as a software system executes can help software engineers perform some tasks on a system more effectively. To interpret the sizable amount of data generated from a system's execution, engineers require tool support. We have ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Extending the ODMG object model with composite objects
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 259–270https://doi.org/10.1145/286936.286965In this paper we extend the ODMG object data model with composite objects. A composite object is an object built by aggregating other component objects. Exclusiveness and dependency constraints, as well as referential integrity, can be associated with ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
System support for object groups
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 244–258https://doi.org/10.1145/286936.286961This paper draws several observations from our experiences in building support for object groups. These observations actually go beyond our experiences and may apply to many other developments of object based distributed systems.Our first experience ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Question time! about use cases
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 226–229https://doi.org/10.1145/286936.286960Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Parametric polymorphism for Java: a reflective solution
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 216–225https://doi.org/10.1145/286936.286959A number of inadequacies of existing implementation techniques for extending Java™ with parametric polymorphism are revealed. Homogeneous translations are the most space-efficient but they are not compatible with reflection, some models of ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Compatible genericity with run-time types for the Java programming language
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 201–215https://doi.org/10.1145/286936.286958The most serious impediment to writing substantial programs in the Java™ programming language is the lack of a gentricity mechanism for abstracting classes and methods with respect to type. During the past two years, several research groups have ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Making the future safe for the past: adding genericity to the Java programming language
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 183–200https://doi.org/10.1145/286936.286957We present GJ, a design that extends the Java programming language with generic types and methods. These are both explained and implemented by translation into the unextended language. The translation closely mimics the way generics are emulated by ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
The new crop of Java virtual machines (panel)
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 179–182https://doi.org/10.1145/286936.286956Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
A lambda calculus of objects with self-inflicted extension
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 166–178https://doi.org/10.1145/286936.286955In this paper we investigate, in the context of functional prototype-based languages, objects which might extend themselves upon receiving a message. The possibility for an object of extending its own "self", referred to by Cardelli, as a self-inflicted ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Logical observable entities
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 154–165https://doi.org/10.1145/286936.286954We show how finite-state machines can standardize the protocol used by a component object to notify other interested objects of its state changes, resulting in a more effective use of static types to constrain both parties, and a more efficient ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10 - ArticleOctober 1998
Data groups: specifying the modification of extended state
OOPSLA '98: Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applicationsPages 144–153https://doi.org/10.1145/286936.286953This paper explores the interpretation of specifications in the context of an object-oriented programming language with subclassing and method overrides. In particular, the paper considers annotations for describing what variables a method may change ...
Also Published in:
ACM SIGPLAN Notices: Volume 33 Issue 10