|
|
1.1 ! root 1: \begin{thebibliography}{10} ! 2: ! 3: \bibitem{appel87:gc} ! 4: Andrew~W. Appel. ! 5: \newblock Garbage collection can be faster than stack allocation. ! 6: \newblock {\em Information Processing Letters}, 25(4):275--279, 1987. ! 7: ! 8: \bibitem{appel89:cps} ! 9: Andrew~W. Appel. ! 10: \newblock Continuation-passing, closure-passing style. ! 11: \newblock In {\em Sixteenth ACM Symp. on Principles of Programming Languages}, ! 12: pages 293--302, 1989. ! 13: ! 14: \bibitem{appel89:sggc} ! 15: Andrew~W. Appel. ! 16: \newblock Simple generational garbage collection and fast allocation. ! 17: \newblock {\em Software---Practice/Experience}, 1989. ! 18: ! 19: \bibitem{appel89:tag} ! 20: Andrew~W. Appel. ! 21: \newblock Tag bits aren't necessary. ! 22: \newblock {\em Lisp and Symbolic Computation}, 1989. ! 23: ! 24: \bibitem{appel88:prof} ! 25: Andrew~W. Appel, Bruce~F. Duba, and David~B. MacQueen. ! 26: \newblock Profiling in the presence of optimization and garbage collection. ! 27: \newblock Technical Report CS-TR-197-88, Princeton University Dept. Comp. Sci., ! 28: Princeton, NJ, 1987. ! 29: ! 30: \bibitem{appel88:gc} ! 31: Andrew~W. Appel, John~R. Ellis, and Kai Li. ! 32: \newblock Real-time concurrent collection on stock multiprocessors. ! 33: \newblock {\em SIGPLAN Notices (Proc. SIGPLAN '88 Conf. on Prog. Lang. Design ! 34: and Implementation)}, 23(7):11--20, 1988. ! 35: ! 36: \bibitem{appel88:clo} ! 37: Andrew~W. Appel and Trevor T.~Y. Jim. ! 38: \newblock Optimizing closure environment representations. ! 39: \newblock Technical Report 168, Dept. of Computer Science, Princeton ! 40: University, 1988. ! 41: ! 42: \bibitem{appel87:sml} ! 43: Andrew~W. Appel and David~B. MacQueen. ! 44: \newblock A {S}tandard {ML} compiler. ! 45: \newblock In Gilles Kahn, editor, {\em Functional Programming Languages and ! 46: Computer Architecture (LNCS 274)}, pages 301--324. Springer--Verlag, 1987. ! 47: ! 48: \bibitem{britton75} ! 49: Dianne~E. Britton. ! 50: \newblock Heap storage management for the programming language {P}ascal. ! 51: \newblock Master's thesis, University of Arizona, 1975. ! 52: ! 53: \bibitem{cardelli83:ml} ! 54: Luca Cardelli. ! 55: \newblock {ML} under {U}nix. ! 56: \newblock {\em Polymorphism}, 1(3), December 1983. ! 57: ! 58: \bibitem{cardelli84} ! 59: Luca Cardelli. ! 60: \newblock Compiling a functional language. ! 61: \newblock In {\em 1984 Symp. on LISP and Functional Programming}, pages ! 62: 208--217, 1984. ! 63: ! 64: \bibitem{cheney70} ! 65: C.~J. Cheney. ! 66: \newblock A nonrecursive list compacting algorithm. ! 67: \newblock {\em Communications of the ACM}, 13(11):677--678, 1970. ! 68: ! 69: \bibitem{cormack88} ! 70: G.~V. Cormack. ! 71: \newblock A micro-kernel for concurrency in {C}. ! 72: \newblock {\em Software---Practice/Experience}, 18(5):485--492, 1988. ! 73: ! 74: \bibitem{gordon78} ! 75: M.~J.~C. Gordon, A.~J. R.~G. Milner, L.~Morris, M.~C. Newey, and C.~P. ! 76: Wadsworth. ! 77: \newblock A metalanguage for interactive proof in {LCF}. ! 78: \newblock In {\em Fifth ACM Symp. on Principles of Programming Languages}, ! 79: 1978. ! 80: ! 81: \bibitem{griswold86} ! 82: Ralph~E. Griswold and Madge~T. Griswold. ! 83: \newblock {\em The Implementation of the {I}con Programming Language}. ! 84: \newblock Princeton University Press, Princeton, NJ, 1986. ! 85: ! 86: \bibitem{harper88} ! 87: Robert Harper, Robin Milner, and Mads Tofte. ! 88: \newblock The definition of {S}tandard {ML}, version 2. ! 89: \newblock Technical Report ECS-LFCS-88-62, Univ. of Edinburgh, 1988. ! 90: ! 91: \bibitem{kernighan78} ! 92: Brian~W. Kernighan and Dennis~M. Ritchie. ! 93: \newblock {\em The {C} Programming Language}. ! 94: \newblock Prentice-Hall, Englewood Cliffs, NJ, 1978. ! 95: ! 96: \bibitem{kranz86} ! 97: D.~Kranz, R.~Kelsey, J.~Rees, P.~Hudak, J.~Philbin, and N.~Adams. ! 98: \newblock {ORBIT}: An optimizing compiler for {S}cheme. ! 99: \newblock {\em SIGPLAN Notices (Proc. Sigplan '86 Symp. on Compiler ! 100: Construction)}, 21(7):219--233, July 1986. ! 101: ! 102: \bibitem{lieberman83} ! 103: Henry Lieberman and Carl Hewitt. ! 104: \newblock A real-time garbage collector based on the lifetimes of objects. ! 105: \newblock {\em Communications of the ACM}, 23(6):419--429, 1983. ! 106: ! 107: \bibitem{macqueen84} ! 108: David MacQueen. ! 109: \newblock Modules for {S}tandard {ML}. ! 110: \newblock In {\em Proc. 1984 ACM Conf. on LISP and Functional Programming}, ! 111: pages 198--207, 1984. ! 112: ! 113: \bibitem{milner84} ! 114: Robin Milner. ! 115: \newblock A proposal for {S}tandard {ML}. ! 116: \newblock In {\em ACM Symposium on LISP and Functional Programming}, pages ! 117: 184--197, 1984. ! 118: ! 119: \bibitem{milner85} ! 120: Robin Milner. ! 121: \newblock The {S}tandard {ML} core language. ! 122: \newblock {\em Polymorphism}, 2(2), October 1985. ! 123: ! 124: \bibitem{rees86} ! 125: J.~Rees and W.~Clinger (eds.). ! 126: \newblock Revised report on the algorithmic language {S}cheme. ! 127: \newblock {\em SIGPLAN Notices}, 21(12):37--79, 1986. ! 128: ! 129: \bibitem{steele78} ! 130: Guy~L. Steele. ! 131: \newblock Rabbit: a compiler for {S}cheme. ! 132: \newblock Technical Report AI-TR-474, MIT, 1978. ! 133: ! 134: \bibitem{ungar84} ! 135: David Ungar. ! 136: \newblock Generation scavenging: a non-disruptive high performance storage ! 137: reclamation algorithm. ! 138: \newblock {\em SIGPLAN Notices (Proc. ACM SIGSOFT/SIGPLAN Software Eng. Symp. ! 139: on Practical Software Development Environments)}, 19(5):157--167, 1984. ! 140: ! 141: \end{thebibliography}
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.