Cong-Cong Xing
ABSTRACT
Object type graphs (OTG) [5] are a new typing scheme for objects. It redefines object types by adding object component interdependencies (links) into object type representations. As such, it can prevent, by a more rigorous type-checking, program runtime errors that cannot be avoided under conventional object type systems. Unfortunately, links, as a key concept in the notion of OTG, have not been fully understood in the sense that it is unclear how to compute them. This paper addresses the links issue in the following way: (1) present an initial link computation algorithm; (2) illustrate how this algorithm works by providing some computation examples; (3) carry out a time complexity analysis of this algorithm.
- Martin Abadi and Luca Cardelli. A Theory of Objects. Springer-Verlag, New York, 1996. Google Scholar
Digital Library
- Kim Bruce. A paradigmatic object-oriented programming language: Design, static typing and semantics. Journal of Functional Programming, 4(2):127--206, 1994.Google ScholarCross Ref
- Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In Graph-Grammars and Their Applications to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 1--69. Springer-Verlag, 1978. Google ScholarDigital Library
- Hartmut Ehrig, Michael Pfender, and Hans Jürgen Schneider. Graph grammars: An algebraic approach. In IEEE Conference of Automata and Switching Theory, pages 167--180, 1973.Google Scholar
- Cong-Cong Xing and B. Belkhouche. The movable point problem and its resolution in object type graphs. In Proc of the 2005 ACM Southeast Conference, Kennesaw, CA, 2005. (Best Paper). Google ScholarDigital Library
Index Terms
- An algorithm for computing links
Recommendations
Parallel Fiber-Optic SCI Links
This work was supported by ARPA under contract MDA972-92-C-0075 and by the IBM Corporation. Dave Engebretsen was employed by the IBM Corporation at the time this work was performed.As the drive to include more and more processors and I/O devices in a ...
The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism
ECOOP '95: Proceedings of the 9th European Conference on Object-Oriented ProgrammingConcrete types and abstract types are different and serve different purposes. Concrete types, the focus of this paper, are essential to support compilation, application delivery, and debugging in object-oriented environments. Concrete types should not ...
A Partial Type Checking Algorithm for Type
We analyze a partial type checking algorithm for the inconsistent domain-free pure type system Type:Type (λ*). We show that the algorithm is sound and partially complete using a coinductive specification of algorithmic equality. This entails that the ...
Comments