Runtime Tags Aren't Necessary (1988)

Cached

Download Links

by Andrew W. Appel , Andrew W
Citations:64 - 4 self

Documents Related by Co-Citation

1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
625 Compiling With Continuations – A W Appel - 1992
18 Heap Storage Management for the Programming Language Pascal – Dianne E Britton - 1975
108 Garbage Collection Can Be Faster Than Stack Allocation – Andrew W. Appel - 1987
47 An Ad-Hoc Approach to the Implementation of Polymorphism – R. Morrison, A. Dearle, R.C.H. Connor, A.L. Brown - 1991
38 Tag-free garbage collection for strongly typed programming languages – Benjamin Goldberg - 1991
337 Generation scavenging: A non-disruptive high performance storage reclamation algorithm – David M Ungar - 1984
31 Polymorphic Type Reconstruction for Garbage Collection without Tags – Benjamin Goldberg, Michael Gloger - 1992
30 Garbage Collection for Strongly-Typed Languages using Run-time Type Reconstruction – Shail Aditya, Christine H. Flood, James E. Hicks - 1994
92 A Standard ML Compiler – Andrew W. Appel, David B. Macqueen - 1987
253 A real-time garbage collector based on the lifetimes of objects – Henry Lieberman, Carl Hewitt, Danny Hillis - 1983
111 Continuation-passing, closure-passing style – Trevor Jim - 1989
171 Unboxed Objects and Polymorphic Typing – Xavier Leroy - 1992
67 Tag-free Garbage Collection Using Explicit Type Parameters – Andrew Tolmach
55 Combining generational and conservative garbage collection: Framework and implementations – A Demmers, M Weiser, B Hayes, H Boehm, D Bobrow, S Shenker - 1990
110 Type inference for polymorphic references – M Tofte - 1990
235 A nonrecursive list compacting algorithm – C J Cheney - 1970
19 Compiler-directed Type Reconstruction for Polymorphic Languages – Shail Aditya - 1993
185 Simple Generational Garbage Collection and Fast Allocation – Andrew W. Appel - 1988