ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Type-extension type test can be performed in constant time
Full text PdfPdf (223 KB)
Source ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 13 ,  Issue 4  (October 1991) table of contents
Pages: 626 - 629  
Year of Publication: 1991
ISSN:0164-0925
Author
Norman H. Cohen  T. J. Watson Research Center, Yorktown Heights, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 32,   Citation Count: 20
Additional Information:

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/115372.115297
What is a DOI?

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
DIJKSTRA, E.W. Recursive programming. Numer. Math. 2 (1960), 312-318.
2
N. Wirth, Type extensions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.2, p.204-214, April 1988  [doi>10.1145/42190.46167]

CITED BY  20
Angelo Corsaro , Ron K. Cytron, Efficient memory-reference checks for real-time java, ACM SIGPLAN Notices, v.38 n.7, July 2003
Yoav Zibin , Joseph Yossi Gil, Efficient subtyping tests with PQ-encoding, ACM SIGPLAN Notices, v.36 n.11, p.96-107, 11/01/2001
S. Muthukrishnan , Martin Müller, Time and space efficient method-lookup for object-oriented programs, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.42-51, January 28-30, 1996, Atlanta, Georgia, United States
Kazuaki Ishizaki , Motohiro Kawahito , Toshiaki Yasue , Mikio Takeuchi , Takeshi Ogasawara , Toshio Suganuma , Tamiya Onodera , Hideaki Komatsu , Toshio Nakatani, Design, implementation, and evaluation of optimizations in a just-in-time compiler, Proceedings of the ACM 1999 conference on Java Grande, p.119-128, June 12-14, 1999, San Francisco, California, United States
Jan Vitek , R. Nigel Horspool , Andreas Krall, Efficient type inclusion tests, ACM SIGPLAN Notices, v.32 n.10, p.142-157, Oct. 1997
Yoav Zibin , Joseph Yossi Gil, Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching, ACM SIGPLAN Notices, v.37 n.11, November 2002
Cliff Click , John Rose, Fast subtype checking in the HotSpot JVM, Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande, p.96-107, November 03-05, 2002, Seattle, Washington, USA
Joseph (Yossi) Gil , Yoav Zibin, Efficient subtyping tests with PQ-encoding, ACM Transactions on Programming Languages and Systems (TOPLAS), v.27 n.5, p.819-856, September 2005
Jean Privat , Roland Ducournau, Link-time static analysis for efficient separate compilation of object-oriented languages, ACM SIGSOFT Software Engineering Notes, v.31 n.1, January 2006
Yangjun Chen , Donovan Cooke, On the transitive closure representation and adjustable compression, Proceedings of the 2006 ACM symposium on Applied computing, April 23-27, 2006, Dijon, France
C. Bernardeschi , N. De Francesco , G. Lettieri , L. Martini , P. Masci, Decomposing bytecode verification by abstract interpretation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.31 n.1, p.1-63, December 2008
Bowen Alpern , Anthony Cocchi , David Grove, Dynamic type checking in jalapeño, Proceedings of the JavaTM Virtual Machine Research and Technology Symposium on JavaTM Virtual Machine Research and Technology Symposium, p.4-4, April 23-24, 2001, Monterey, California
Ben L. Titzer, Virgil: objects on the head of a pin, ACM SIGPLAN Notices, v.41 n.10, October 2006
Sébastien Baehni , João Barreto , Patrick Eugster , Rachid Guerraoui, Efficient distributed subtyping tests, Proceedings of the 2007 inaugural international conference on Distributed event-based systems, June 20-22, 2007, Toronto, Ontario, Canada
Bob Brown, Non-linear type extensions, ACM SIGPLAN Notices, v.29 n.2, p.39-43, Feb. 1994
Hamed Seiied Alavi , Seth Gilbert , Rachid Guerraoui, Extensible encoding of type hierarchies, ACM SIGPLAN Notices, v.43 n.1, January 2008
Jens Teubner, Scalable XQuery type matching, Proceedings of the 11th international conference on Extending database technology: Advances in database technology, March 25-29, 2008, Nantes, France
Yangjun Chen, A new method for generating compressed representation of transitive closure, Proceedings of the 2008 C3S2E conference, May 12-13, 2008, Montreal, Quebec, Canada
Roland Ducournau, Perfect hashing as an almost perfect subtype test, ACM Transactions on Programming Languages and Systems (TOPLAS), v.30 n.6, p.1-56, October 2008
Yangjun Chen, General spanning trees and reachability query evaluation, Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering, May 19-21, 2009, Montreal, Quebec, Canada

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Data types and structures

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Procedures, functions, and subroutines

  E. Data
  E.1 DATA STRUCTURES
      Subjects: Lists, stacks, and queues
  E.2 DATA STORAGE REPRESENTATIONS
      Subjects: Linked representations


General Terms:
Algorithms, Languages, Performance, Theory


Keywords:
class, descriptor, display, extensible data type, inheritance, membership test, object-oriented programming, type extension, type test

Collaborative Colleagues:
Norman H. Cohen: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player