An approach to improve locality using sandwich types

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

Volumn 1473, Issue , 1998, Pages 194-214

  Genius, Daniela ^a   Trapp, Martin ^a   Zimmermann, Wolf ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPILE TIME; OBJECT-ORIENTED PROGRAM; PERFORMANCE MEASUREMENTS; RUNNING TIME; SANDWICH TYPES;

OBJECT ORIENTED PROGRAMMING;

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

References (13)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983.
2. P. S. Almeida. Balloon types: Controlling sharing of state in data types. In EC OOP' 97-Object-Oriented Programming, volume 1241 of Lecture Notes in Computer Science, pages 32-59, 1997.
3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw Hill, 1991.
4. Free Software Foundation. The GNU C library. URL: http://www. gnu. ai. mit. edu/software/libc/libc. html.
5. Y. Gurevich. Evolving Algebras: Lipari Guide. In E. Börger, editor, Specification and Validation Methods. Oxford University Press, 1995.
6. Barry Hayes. Using Key Object Opportunism to Collect Old Objects. In Proceedings of the OOPSLA '91 Conference on Object-oriented Programming Systems, Languages and Applications, pages 33-46, nov 1991. Published as ACM SIGPLAN Notices, volume 26, number 11.
7. J. J. Horning. A case study in language design: Euclid. In F. L. Bauer and M. Broy, editors, Proceedings of the International Summer School on Program Construction, volume 69 of LNCS, pages 125-132, Marktoberdorf, FRG, July-August 1978. Springer.
8. Daniel H. H. Ingalls. The smalltalk-76 programming system design and implementation. In Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, Arizona, pages 9-16. ACM, January 1978.
9. Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, July 1996. With a chapter on Distributed Garbage Collection by R. Lins. Reprinted February 1997.
10. H. W. Schmidt and W. Zimmermann. A complexity calculus for object-oriented programs. Journal of Object-Oriented Systems, 1(2): 117-147, 1994.
11. H. W. Schmidt and W. Zimmermann. Reasoning about complexity of object-oriented programs. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, volume A-56 of IF IP Transactions, pages 553-572, 1994.
12. James W. Stamos. Static grouping of small objects to enhance performance of a paged virtual memory. ACM Transactions on Computer Systems, 2(2): 155-180, May 1984.
13. A. Tarski. A lattice-theoretical fixpoint theorem and its application. Pacific J. Math., 5: 285-309, 1955.