ACM Home Page
Please provide us with feedback. Feedback
The movable point problem and its resolution in object type graphs
Full text PdfPdf (390 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 43rd annual Southeast regional conference - Volume 2 table of contents
Kennesaw, Georgia
SESSION: Software design, languages and systems table of contents
Pages: 315 - 320  
Year of Publication: 2005
ISBN:1-59593-059-0
Authors
Cong-cong Xing  Nicholls State University, Thibodaux, LA
Boumediene Belkhouche  Tulane University, New Orleans, LA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 10,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1167253.1167322
What is a DOI?

ABSTRACT

Internal dependencies among object components characterize the behaviors of objects and differentiate objects from records. Fundamental typing/subtyping shortcomings and loopholes still persist in current object type systems due to the overlooking of such interdependencies. In this paper, we first identify a new movable point problem that exists in conventional object type systems. Then, as a new approach to the typing of object-oriented languages, we propose object type graphs (OTG) where object component interdependencies are integrated into object types. Object subtyping is subsequently defined by reasoning on the relevant type graphs. Finally, we show how the movable point problem can be easily resolved under OTG.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Kim Bruce. A paradigmatic object-oriented programming language: Design, static typing and semantics. Journal of Functional Programming, 4(2):127--206, 1994.
 
4
5
6
 
7
 
8
 
9
 
10
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.
 
11
 
12
Jason Hickey. Introduction to OCaml, http://caml.inria.fr/tutorials-eng.html. 2002.
 
13
 
14
L. Liquori and G. Castagna. A typed lambda calculus of objects. Number 1179 in Lecture Notes in Computer Science, pages 129--141. Sringer-Verlag, 1996.
 
15
 
16
 
17


Collaborative Colleagues:
Cong-cong Xing: colleagues
Boumediene Belkhouche: colleagues