|
1497
|
The Definition of Standard ML
– R Milner, M Tofte, R Harper
- 1990
|
|
595
|
Compiling with Continuations
– Andrew Appel
- 1992
|
|
62
|
A Runtime System
– Andrew W. Appel
- 1990
|
|
58
|
Adding Threads to Standard ML
– Eric C. Cooper, J. Gregory Morrisett
- 1990
|
|
13
|
Concurrent programming in ML
– Norman Ramsey
- 1990
|
|
69
|
Continuation-Based Multiprocessing
– Mitchell Wand
- 1980
|
|
88
|
Typing First-Class Continuations in ML
– Robert Harper, Bruce F. Duba, David Macqueen
- 1992
|
|
170
|
Simple Generational Garbage Collection and Fast Allocation
– Andrew W. Appel
- 1988
|
|
70
|
Representing Control in the Presence of First-Class Continuations
– Robert Hieb, R. Kent Dybvig, Carl Bruggeman
- 1990
|
|
47
|
The SIMPLE code
– W P Crowley, C P Hendrickson, T E Rudy
- 1978
|
|
64
|
Compiler Support for Garbage Collection in a Statically Typed Language
– Amer Diwan, Eliot Moss, Richard Hudson
- 1992
|
|
50
|
No Assembly Required: Compiling Standard ML to C
– David Tarditi, Peter Lee, Anurag Acharya
- 1990
|
|
80
|
A semantics for ML concurrency primitives
– Dave Berry, Robin Milner, David N. Turner
- 1992
|
|
121
|
Higher-order Concurrency
– John Hamilton Reppy
- 1992
|
|
103
|
Garbage Collection Can Be Faster Than Stack Allocation
– Andrew W. Appel
- 1987
|
|
89
|
A Standard ML Compiler
– Andrew W. Appel, David B. Macqueen
- 1987
|
|
190
|
ORBIT: An optimizing compiler for Scheme
– D KRANZ, R KELSEY, J REES, P HUDAK, J PHILBIN, N ADAMS
- 1986
|
|
107
|
Continuation-passing, closure-passing style
– Trevor Jim
- 1989
|
|
6
|
Concurrent programming with events
– John H Reppy
- 1990
|
