Near optimal hierarchical encoding of types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1241, Issue , 1997, Pages 128-145

  Krall, Andreas ^a   Vitek, Jan ^b   Nigel Horspool, R ^c  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF GENEVA   (Switzerland)

^c UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

C++ (PROGRAMMING LANGUAGE); ENCODING (SYMBOLS); FORMAL LANGUAGES; SIGNAL ENCODING;

CONSTANT TIME; EFFICIENT IMPLEMENTATION; GRAPH COLORINGS; HIERARCHICAL ENCODING; INCLUSION TEST; MULTIPLE SUBTYPING; NEAR-OPTIMAL; TYPE HIERARCHIES;

OBJECT ORIENTED PROGRAMMING;

EID: 84947933540     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053377     Document Type: Conference Paper

References (13)

1. Hassan Aït-Kaci, Robert Boyer, Patrick Lincoln, and Roger Nasr. Efficient implementation of lattice operations. A CM Transactions on Programming Languages and Systems, 11(1):115-146, 1989.
2. Preston Briggs, Keith Cooper, Ken Kennedy, and Linda Torczon, Coloring heuristics for register allocation. In ACM Conference on Programming Language Design and Implementation, pages 275-284, Portland, June 1993. ACM.
3. Yves Caseau. Efficient handling of multiple inheritance hierarchies. In Conference on Object Oriented Programming Systems, Languages Apphcations, pages 271-287, Washington, October 1993. ACM.
4. Norman H. Cohen. Type-extension type tests can be performed in constant time. ACM Transactions on Programming Languages and Systems, 13(4):626-629, 1991.
5. Peter Dencker, Karl Diirre, and Johannes Heuft. Optimization of parser tables for portable compilers. A CM Transactions on Programming Languages and Systems, 6(6):546-572, 1984.
6. J. A Ellis and P. M Lepolesa. ALas Vegas graph coloring algorithm. The Computer Journal, 32(5):474-476, 1989.
7. Charles Fleurent and Jacques A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operatwns Research, page to appear, 1995.
8. James Gosling, Frank Yellin, and The Java Team. The Java Application Programmzng Interface. Addison-Weley, 1996.
9. Michel Habib and Lhouari Nourine. Bit-vector encoding for partially ordered sets. In ORDAL'94, LNCS 831, pages 1-12. Springer, 1994.
10. Michel Habib and Lhouari Nourine. Tree structure for distributive lattices and its applications. Theoretical Computer Science, 165:391-405, 1996.
11. David W. Matula and Leland L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. Journal of the ACM, 30(3):417-427, July 1983.
12. David W. Matula, George Marble, and Joel D. Isaacson. Graph coloring algorithms. In R. C. Read, editor, Graph Theory and Computing, pages 109-122. Academic Press, 1972.
13. Niklaus Wirth. Type extensions. A CM Transactions on Programming Languages and Systems, 10(2):204-214, 1988.