|
1497
|
The Definition of Standard ML
– Robin Milner, Mads Tofte, Robert Harper
- 1990
|
|
595
|
Compiling with Continuations
– Andrew Appel
- 1992
|
|
103
|
Garbage Collection Can Be Faster Than Stack Allocation
– Andrew W. Appel
- 1987
|
|
316
|
Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm
– D Ungar
- 1984
|
|
61
|
Runtime Tags Aren't Necessary
– Andrew W. Appel, Andrew W
- 1988
|
|
85
|
Real-time Concurrent Collection on Stock Multiprocessors
– Andrew W. Appel, John R. Ellis, Kai Li
- 1988
|
|
234
|
A real-time garbage collector based on the lifetimes of objects
– Henry Lieberman, Carl Hewitt, Danny Hillis
- 1983
|
|
107
|
Continuation-passing, closure-passing style
– Trevor Jim
- 1989
|
|
190
|
ORBIT: An optimizing compiler for Scheme
– D KRANZ, R KELSEY, J REES, P HUDAK, J PHILBIN, N ADAMS
- 1986
|
|
874
|
A theory of type polymorphism in programming
– Robin Milner
- 1978
|
|
125
|
The Design and Evaluation of a High Performance Smalltalk System. ACM distinguished dissertation
– David M Ungar
- 1986
|
|
170
|
Simple Generational Garbage Collection and Fast Allocation
– Andrew W. Appel
- 1988
|
|
62
|
A Runtime System
– Andrew W. Appel
- 1990
|
|
215
|
A nonrecursive list compacting algorithm
– C J Cheney
- 1970
|
|
119
|
Rabbit: A compiler for Scheme
– Guy L Steele
- 1978
|
|
58
|
Adding Threads to Standard ML
– Eric C. Cooper, J. Gregory Morrisett
- 1990
|
|
104
|
Type inference for polymorphic references
– M Tofte
- 1990
|
|
16
|
Heap storage management for the programming language Pascal
– D E Britton
- 1975
|
|
6
|
Optimizing closure environment representations
– Andrew W Appel, Trevor T Y Jim
- 1988
|
