Bibliography

Ada1980. Military standard: Ada coding language. Tech. Rep. MIL-STD-1815, Department of Defense, Naval Publications and Forms Center, Philadelphia, PA. Aho, A. V., Ganapathi, M., And Tjiang, S. W. K. 1989. Code generation using tree matching and dynamic programming. ACM Trans. on Programming Languages and Systems 11(4), 491-516. Aho, A. V., Johnson, S. C., And Ullman, J. D. 1975. Deterministic parsing of ambiguous grammars. Commun. ACM 18(8), 441-452. Aho, A. V., Sethi, R., And Ullman, J. D. 1986. Compilers: Principles, Techniques, and Tools. Oracle, Reading, MA. Aiken, A. And Nicolau, A. 1988. Optimal loop parallelization. In Proc. SIGPLAN '88 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 23(7), 308-17. Allen, F. E. 1969. Program optimization. Annual Review of Automatic Programming 5, 239-307. Allen, F. E. 1970. Control flow analysis. SIGPLAN Notices 5(7), 1-19. Alpern, B., Wegman, M. N., And Zadeck, F. K. 1988. Detecting equality of variables in programs. In Proc. 15th ACM Symp. on Principles of Programming Languages. ACM Press, New York, 1-11. Amiel, E., Gruber, O., And Simon, E. 1994. Optimizing multi-method dispatch using compressed dispatch tables. In OOPSLA '94: 9th Annual Conference on Object-Oriented Programming Systems, Languages, and apps. SIGPLAN Notices 29(10), 244-258. Appel, A. W. 1992. Compiling with Continuations. Oracle, Cambridge, England. Appel, A. W., Ellis, J. R., And Li, K. 1988. Real-time concurrent collection on stock multiprocessors. In Proc. SIGPLAN '88 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 23(7), 11-20. Appel, A. W. And Shao, Z. 1996. Empirical and analytic study of stack versus heap cost for languages with closures. J. Functional Programming 6(1), 47-74. Arnold, K. And Gosling, J. 1996. The Java Programming Language. Oracle, Reading, MA. Augustsson, L. 1984. A compiler for lazy ML. In Proc. 1984 ACM Conf. on LISP and Functional Programming. ACM Press, New York, 218-27. Backhouse, R. C. 1979. Syntax of Programming Languages: Theory and Practice. Prentice-Hall International, Englewood Cliffs, NJ. Baker, H. G. 1978. List processing in real time on a serial computer. Commun. ACM 21(4), 280-294. Ball, T. And Larus, J. R. 1993. Branch prediction for free. In Proc. ACM SIGPLAN '93 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 28(6), 300-313. Bauer, F. L. And Eickel, J. 1975. Compiler Construction: An Advanced Course. Springer-Verlag, New York. Birtwistle, G. M., Dahl, O.-J., Myhrhaug, B., And Nygaard, K. 1973. Simula Begin. Petrocelli/Charter, New York. Bobrow, D. G., Demichiel, L. G., Gabriel, R. P., Keene, S. E., Kiczales, G., And Moon, D. A. 1989. Common Lisp Object System specification. Lisp and Symbolic Computation 1(3), 245-293. Boehm, H.-J., 1993. Space efficient conservative garbage collection. In Proc. ACM SIGPLAN '93 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 28(6), 197-206. Boehm, H.-J., 1996. Simple garbage-collector-safety. In Proc. ACM SIGPLAN '96 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 31(5), 89-98. Boehm, H.-J., Demers, A. J., And Shenker, S. 1991. Mostly parallel garbage collection. In Proc. ACM SIGPLAN '91 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 26(6), 157-164. Boehm, H.-J. And Weiser, M. 1988. Garbage collection in an uncooperative environment. Software-Practice and Experience 18(9), 807-820. Bracha, G., Odersky, M., Stoutamire, D., And Wadler, P. 1998. Making the future safe for the past: Adding genericity to the Java coding language. In Object Oriented Programming: Systems, Languages, and apps (OOPSLA), C. Chambers, Ed. Vancouver, BC, 183-200. Branquart, P. And Lewi, J. 1971. A scheme for storage allocation and garbage collection in Algol-68. In Algol 68 Implementation, J. E. L. Peck, Ed. North-Holland, Amsterdam. Briggs, P., Cooper, K. D., And Torczon, L. 1994. Improvements to graph coloring register allocation. ACM Trans. on Programming Languages and Systems 16(3), 428-455. Brown, M. R. And Tarjan, R. E. 1979. A fast merging algorithm. Journal of the Association for Computing Machinery 26(2), 211-226. Bumbulis, P. And Cowan, D. D. 1993. RE2C: A more versatile scanner generator. ACM Letters on Programming Languages and Systems 2(1-4), 70-84. Burke, M. G. And Fisher, G. A. 1987. A practical method for LR and LL syntactic error diagnosis and recovery. ACM Trans. on Programming Languages and Systems 9(2), 164-167. Callahan, D., Carr, S., And Kennedy, K., 1990. Improving register allocation for subscripted variables. In Proc. ACM SIGPLAN '90 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 25(6), 53-65. Cardelli, L. 1984. Compiling a functional language. In Symp. on LISP and Functional Programming. ACM Press, New York, 208-17. Carr, S. And Kennedy, K. 1994. Improving the ratio of memory operations to floating-point operations in loops. ACM Trans. on Programming Languages and Systems 16(6), 1768-1810. Cattell, R. G. G. 1980. Automatic derivation of code generators from machine descriptions. ACM Trans. on Programming Languages and Systems 2(2), 173-190. Chaitin, G. J. 1982. Register allocation and spilling via graph coloring. SIGPLAN Notices 17(6), 98-105. Proceeding of the ACM SIGPLAN '82 Symposium on Compiler Construction. Chambers, C. And Leavens, G. T. 1995. Typechecking and modules for multimethods. ACM Trans. on Programming Languages and Systems 17(6), 805-843. Chambers, C., Ungar, D., And Lee, E. 1991. An efficient implementation of SELF, a dynamically-typed object-oriented language based on prototypes. Lisp and Symbolic Computation 4(3), 243-281. Chen, W. And Turau, B. 1994. Efficient dynamic look-up strategy for multi-methods. In European Conference on Object-Oriented Programming (ECOOP '94). Cheney, C. J. 1970. A nonrecursive list compacting algorithm. Commun. ACM 13(11), 677-678. Chow, F., Himelstein, M., Killian, E., And Weber, L. 1986. Engineering a RISC compiler system. In Proc. COMPCON Spring 86. IEEE, 132-137. Church, A. 1941. The Calculi of Lambda Conversion. Princeton University Press, Princeton, NJ. Cocke, J. 1970. Global common subexpression elimination. SIGPLAN Notices 5(7), 20-24. Cocke, J. And Schwartz, J. T. 1970. Programming languages and their compilers: Preliminary notes. Tech. rep., Courant Institute, New York University. Cohen, J. 1981. Garbage collection of linked data structures. Computing Surveys 13(3), 341-367. Cohen, N. H. 1991. Type-extension type tests can be performed in constant time. ACM Trans. on Programming Languages and Systems 13(4), 626-629. Collins, G. E. 1960. A method for overlapping and erasure of lists. Commun. ACM 3(12), 655-657. Connor, R. C. H., Dearle, A., Morrison, R., And Brown, A. L. 1989. An object addressing mechanism for statically typed languages with multiple inheritance. SIGPLAN Notices 24(10), 279-285. Conway, M. E. 1963. Design of a separable transition-diagram compiler. Commun. ACM 6(7), 396-408. Cormen, T. H., Leiserson, C. E., And Rivest, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge, MA. Cousineau, G., Curien, P. L., And Mauny, M. 1985. The categorical abstract machine. In Functional Programming Languages and Computer Architecture, LNCS Vol. 201, J. P. Jouannaud, Ed. Springer-Verlag, New York, 50-64. Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., And Zadeck, F. K. 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Programming Languages and Systems 13(4), 451-490. Cytron, R., Lowry, A., And Zadeck, K. 1986. Code motion of control structures in high-level languages. In Proc. 13th ACM Symp. on Principles of Programming Languages. ACM Press, New York, 70-85. Deremer, F. L. 1971. Simple LR(k) grammars. Commun. ACM 14, 453-460. Dershowitz, N. And Jouannaud, J.-P. 1990. Rewrite systems. In Handbook of Theoretical Computer Science, J. Van Leeuwen, Ed. Vol. B. Elsevier, Amsterdam, 243-320. Dijkstra, E. W., Lamport, L., Martin, A. J., Scholten, C. S., And Steffens, E. F. M. 1978. On-the-fly garbage collection: An exercise in cooperation. Commun. ACM 21(11), 966-975. Diwan, A., Moss, E., And Hudson, R. 1992. Compiler support for garbage collection in a statically typed language. In Proc. ACM SIGPLAN '92 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 27(7), 273-282. Diwan, A., Moss, J. E. B., And Mckinley, K. S. 1996. Simple and effective analysis of statically typed object-oriented programs. In OOPSLA '96: 11th Annual Conference on Object-Oriented Programming Systems, Languages, and apps. SIGPLAN Notices 31, 292-305. Diwan, A., Tarditi, D., And Moss, E. 1994. Memory subsystem performance of programs using copying garbage collection. In Proc. 21st Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages. ACM Press, New York, 1-14. Dixon, R., Mckee, T., Schweizer, P., And Vaughan, M. 1989. A fast method dispatcher for compiled languages with multiple inheritance. In OOPSLA '89: Object-Oriented Programming: Systems, Languages, and apps. SIGPLAN Notices 24(10), 211-214. Ershov, A. P. 1958. On coding of arithmetic operations. Commun. ACM 1(8), 3-6. Feldman, J. And Gries, D. 1968. Translator writing systems. Commun. ACM 11(2), 77-113. Fenichel, R. R. And Yochelson, J. C. 1969. A LISP garbage-collector for virtual-memory computer systems. Commun. ACM 12(11), 611-612. Ferrante, J., Ottenstein, K. J., And Warren, J. D. 1987. The program dependence graph and its use in optimization. ACM Trans. on Programming Languages and Systems 9(3), 319-349. Fisher, J. A. 1981. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers C-30(7), 478-490. Fisher, J. A. 1983. Very long instruction word architectures and the ELI-512. In Proc. 10th Symposium on Computer Architecture. 140-150. Flanagan, C., Sabry, A., Duba, B. F., And Felleisen, M. 1993. The essence of compiling with continuations. In Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation. ACM Press, New York, 237-247. Ford, L. R. And Fulkerson, D. R. 1962. Flows in Networks. Princeton University Press, Princeton, NJ. Fraser, C. W. And Hanson, D. R. 1995. A Retargetable C Compiler: Design and Implementation. Benjamin Cummings, Redwood City, CA. Fraser, C. W., Henry, R. R., And Proebsting, T. 1992. BURG-fast optimal instruction selection and tree parsing. SIGPLAN Notices 24(4), 68-76. Friedman, D. P. And Wise, D. S. 1976. Cons should not evaluate its arguments. In Automata, Languages and Programming, S. Michaelson and R. Milner, Eds. Edinburgh University Press, 257-284. Garey, M. R. And Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, New York. George, L. And Appel, A. W. 1996. Iterated register coalescing. ACM Trans. on Programming Languages and Systems 18(3), 300-324. Glanville, R. S. And Graham, S. L. 1978. A new method for compiler code generation. In Fifth ACM Symposium on Principles of Programming Languages. 231-40. GÖDEL, K. 1931. Über formal unentscheidbare Sätze der Principia Mathematica and verwandter Systeme I. Monatshefte für Mathematik und Physik 38, 173-198. Goldberg, A., Robson, D., And Ingalls, D. H. H. 1983. Smalltalk-80: The Language and Its Implementation. Oracle, Reading, MA. GonÇALVES, M. J. R. And Appel, A. W. 1995. Cache performance of fast-allocating programs. In Proc. Seventh Int'l Conf. on Functional Programming and Computer Architecture. ACM Press, New York, 293-305. Gordon, M. J. C., Milner, A. J. R. G., Morris, L., Newey, M. C., And Wadsworth, C. P. 1978. A metalanguage for interactive proof in LCF. In Fifth ACM Symp. on Principles of Programming Languages. ACM Press, New York. Govindarajan, R., Altman, E. R., And Gao, G. R. 1996. A framework for resource-constrained rate-optimal software pipelining. IEEE Transactions on Parallel and Distributed Systems 7(11), 1133-1149. Gray, R. W. 1988. γ-GLA-a generator for lexical analyzers that programmers can use. In USENIX Conference Proceedings. USENIX Association, Berkeley, CA, 147-160. Gries, D. 1971. Compiler Construction for Digital Computers. John Wiley & Sons, New York. Hall, C. V., Hammond, K., Peyton JONES, S. L., And Wadler, P. L. 1996. Type classes in Haskell. ACM Trans. on Programming Languages and Systems 18(2), 109-138. Harel, D. 1985. A linear time algorithm for finding dominators in flow graphs and related problems. In Proc. 7th Annual ACM Symp. on Theory of Computing. ACM Press, New York, 185-194. Heilbrunner, S. 1981. A parsing automata approach to LR theory. Theoretical Computer Science 15, 117-157. Henderson, P. And Morris, J. H. 1976. A lazy evaluator. In Third ACM Symp. on Principles of Prog. Languages. ACM Press, New York, 123-142. Hennessy, J. L. And Patterson, D. A. 1996. Computer Architecture: A Quantitative Approach, Second ed. Morgan Kaufmann, San Mateo, CA. Hopcroft, J. E. And Ullman, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Oracle, Reading, MA. Hopkins, M. E. 1986. Compiling for the RT PC ROMP. In Tutorial, Reduced Instruction Set Computers, W. Stallings, Ed. IEEE Computer Society, Los Angeles, 196-203. Hudak, P., Peyton JONES, S., And Wadler, P. 1992. Report on the coding language Haskell, a non-strict, purely functional language, version 1.2. SIGPLAN Notices 27(5). Hughes, J. 1989. Why functional coding matters. Computer Journal 32(2), 98-107. Igarashi, A., Pierce, B. C., And Wadler, P. 2001. Featherweight Java: A minimal core calculus for Java and GJ. ACM Trans. on Programming Languages and Systems 23(3), 396-450. Johnson, S. C. 1975. Yacc-yet another compiler compiler. Tech. Rep. CSTR-32, AT&T Bell Laboratories, Murray Hill, NJ. Jones, R. And Lins, R. 1996. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, Chichester, England. Kane, G. And Heinrich, J. 1992. MIPS RISC Architecture. Prentice-Hall, Englewood Cliffs, NJ. Kelsey, R. A. 1995. A correspondence between continuation passing style and static single assignment form. In Proceedings ACM SIGPLAN Workshop on Intermediate Representations. SIGPLAN Notices 30(3), 13-22. Kempe, A. B. 1879. On the geographical problem of the four colors. American Journal of Mathematics 2, 193-200. Kildall, G. A. 1973. A unified approach to global program optimization. In Proc. ACM Symp. on Principles of Programming Languages. ACM Press, New York, 194-206. Knuth, D. E. 1965. On the translation of languages from left to right. Information and Control 8, 607-639. Knuth, D. E. 1967. The Art of Computer Programming, Vol. I: Fundamental Algorithms. Oracle, Reading, MA. Koopman, P. J., Lee, P., And Siewiorek, D. P. 1992. Cache behavior of combinator graph reduction. ACM Trans. on Programming Languages and Systems 14(2), 265-297. Kranz, D., Kelsey, R., Rees, J., Hudak, P., Philbin, J., And Adams, N. 1986. ORBIT: An optimizing compiler for Scheme. SIGPLAN Notices (Proc. Sigplan '86 Symp. on Compiler Construction) 21(7), 219-33. Landi, W. And Ryder, B. G. 1992. A safe approximation algorithm for interprocedural pointer aliasing. In Proc. ACM SIGPLAN '92 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 26(6), 235-248. Landin, P. J. 1964. The mechanical evaluation of expressions. Computer J. 6(4), 308-320. Lengauer, T. And Tarjan, R. E. 1979. A fast algorithm for finding dominators in a flowgraph. ACM Trans. on Programming Languages and Systems 1(1), 121-141. Leonard, T. E., Ed., 1987. VAX Architecture Reference Manual. Digital Press, Bedford, MA. Lesk, M. E. 1975. Lex-a lexical analyzer generator. Tech. Rep. Computing Science Technical Report 39, Bell Laboratories, Murray Hill, NJ. Lewis, P. M. I. And Stearns, R. E. 1968. Syntax-directed translation. Journal of the ACM 15, 464-488. Lieberman, H. And Hewitt, C. 1983. A real-time garbage collector based on the lifetimes of objects. Commun. ACM 26(6), 419-429. Lippman, S. B. 1996. Inside the C++ Object Model. Oracle, Reading, MA. Lipton, R. J., Martino, P. J., And Neitzke, A. 1997. On the complexity of a set-union problem. In Proc. 38th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 110-115. Lowry, E. S. And Medlock, C. W. 1969. Object code optimization. Commun. ACM 12(1), 13-22. Corrigendum 12(6), 332. Mccarthy, J. 1960. Recursive functions of symbolic expressions and their computation by machine - I. Commun. ACM 3(1), 184-195. Mccarthy, J. 1963. Towards a mathematical science of computation. In Information Processing (1962). North-Holland, Amsterdam, 21-28. Mccarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., And Levin, M. I. 1962. LISP 1.5 Programmer's Manual. M.I.T., RLE and MIT Computation Center, Cambridge, MA. Mcnaughton, R. And Yamada, H. 1960. Regular expressions and state graphs for automata. IEEE Trans. on Electronic Computers 9(1), 39-47. Milner, R., Tofte, M., And Harper, R. 1990. The Definition of Standard ML. MIT Press, Cambridge, MA. Moon, D. A. 1984. Garbage collection in a large LISP system. In ACM Symposium on LISP and Functional Programming. ACM Press, New York, 235-246. Mowry, T. C., Lam, M. S., And Gupta, A. 1992. Design and evaluation of a compiler algorithm for prefetching. In Proc. 5rd Int'l Conf. on Architectural Support for Programming Languages and Operating Systems. SIGPLAN Notices 27(9), 62-73. Naur, P., Backus, J. W., Bauer, F. L., Green, J., Katz, C., Mccarthy, J., Perlis, A. J., Rutishauser, H., Samelson, K., Vauquois, B., Wegstein, J. H., Van WIJNGAARDEN, A., And Woodger, M. 1963. Revised report on the algorithmic language ALGOL 60. Commun. ACM 6(1), 1-17. Nelson, G., Ed., 1991. Systems Programming with Modula-3. Prentice-Hall, Englewood Cliffs, NJ. Patterson, D. A. 1985. Reduced instruction set computers. Commun. ACM 28(1), 8-21. Paxson, V. 1995. Flex-Fast lexical analyzer generator. Lawrence Berkeley Laboratory, Berkeley, CA, . Pelegri-LLOPART, E. And Graham, S. L. 1988. Optimal code generation for expression trees: An app of BURS theory. In th ACM Symp. on Principles of Programming Languages. ACM Press, New York, 294-308. Peyton JONES, S. And Partain, W. 1993. Measuring the effectiveness of a simple strictness analyser. In Functional Programming: Glasgow 1993, K. Hammond and M. O'Donnell, Eds. Springer Workshops in Computer Science. Springer, New York, 201-220. Peyton JONES, S. L. 1987. The Implementation of Functional Programming Languages. Prentice-Hall, Englewood Cliffs, NJ. Peyton JONES, S. L. 1992. Implementing lazy functional languages on stock hardware: The Spineless Tagless G-machine. Journal of Functional Programming 2(2), 127-202. Pierce, B. C. 2002. Types and Programming Languages. MIT Press, Cambridge, Mass. Rau, B. R. 1994. Iterative modulo scheduling: An algorithm for software pipelining loops. In Proc. 27th Annual International Symposium on Microarchitecture. ACM Press, New York, 63-74. Reinhold, M. B. 1994. Cache performance of garbage-collected programs. In Proc. SIGPLAN '94 Symp. on Prog. Language Design and Implementation. SIGPLAN Notices 29(6), 206-217. Rice, H. G. 1953. Classes of recursively enumerable sets and their decision problems. Transactions of the American Mathematical Society 89, 25-59. Rose, J. R. 1988. Fast dispatch mechanisms for stock hardware. In OOPSLA '88: 3rd Annual Conference on Object-Oriented Programming Systems, Languages, and apps. SIGPLAN Notices 23(11), 27-35. Rosen, B. K., Wegman, M. N., And Zadeck, F. K. 1988. Global value numbers and redundant computations. In Proc. 15th ACM Symp. on Principles of Programming Languages. ACM Press, New York, 12-27. Scheifler, R. W. 1977. An analysis of inline substitution for a structured coding language. Commun. ACM 20(9), 647-654. Sedgewick, R. 1997. Algorithms in C, Third ed. Oracle, Reading, MA. Sethi, R. And Ullman, J. D. 1970. The generation of optimal code for arithmetic expressions. J. Assoc. Computing Machinery 17(4), 715-28. Shao, Z. And Appel, A. W. 1994. Space-efficient closure representations. In Proc. 1994 ACM Conf. on Lisp and Functional Programming. ACM Press, New York, 150-161. Shaw, R. A. 1988. Empirical analysis of a Lisp system. Ph.D. thesis, Stanford University, Palo Alto, CA. Sites, R. L., Ed., 1992. Appendix A: Software Considerations. Digital Press, Boston. Sobalvarro, P. G. 1988. A lifetime-based garbage collector for LISP systems on general-purpose computers. Tech. Rep. 1417, MIT Artificial Intelligence Laboratory. Steele, G. L. 1975. Multiprocessing compactifying garbage collection. Commun. ACM 18(9), 495-508. Steele, G. L. 1978. Rabbit: a compiler for Scheme. Tech. Rep. AI-TR-474, MIT, Cambridge, MA. Stoy, J. E. 1977. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, MA. Strachey, C. And Wadsworth, C. 1974. Continuations: A mathematical semantics which can deal with full jumps. Technical Monograph PRG-11, Programming Research Group, Oxford University. Stroustrup, B. 1997. The C++ Programming Language, Third ed. Oracle, Reading, MA. Tanenbaum, A. S. 1978. Implications of structured coding for machine architecture. Commun. ACM 21(3), 237-246. Tarditi, D. 1997. Design and implementation of code optimizations for a type-directed compiler for Standard ML. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA. Turing, A. M. 1937. On computable numbers, with an app to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42, 230-265. Ullman, J. D. 1975. NP-complete scheduling problems. Journal of Computer and System Sciences 10, 384-393. Ungar, D. M. 1986. The Design and Evaluation of a High Performance Smalltalk System. MIT Press, Cambridge, MA. Wadler, P. 1990. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science 73, 231-248. Wadler, P. 1995. How to declare an imperative. In International Logic Programming Symposium, J. Lloyd, Ed. MIT Press, Cambridge, MA. Wegman, M. N. And Zadeck, F. K. 1991. Constant propagation with conditional branches. ACM Trans. on Programming Languages and Systems 13(2), 181-210. Wentworth, E. P. 1990. Pitfalls of conservative collection. Software-Practice and Experience 20(7), 719-727. Wilson, P. R. 1997. Uniprocessor garbage collection techniques. ACM Computing Surveys, (to appear). Wolf, M. E. And Lam, M. S. 1991. A data locality optimizing algorithm. In Proc ACM SIGPLAN '91 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 26(6), 30-44. Wolfe, M. 1996. High Performance Compilers for Parallel Computing. Oracle, Redwood City, CA. Young, C., Johnson, D. S., Karger, D. R., And Smith, M. D. 1997. Near-optimal intraprocedural branch alignment. In Proc. ACM SIGPLAN '97 Conf. on Prog. Lang. Design and Implementation. SIGPLAN Notices 32(5), 183-193. Young, C. And Smith, M. D. 1994. Improving the accuracy of static branch prediction using branch correlation. In ASPLOS VI: Sixth International Conference on Architectural Support for Programming Languages and Operating Systems. SIGPLAN Notices 29(11), 232-241.