Representing Control in the Presence of First-Class Continuations (1990)

Cached

Download Links

by Robert Hieb , R. Kent Dybvig , Carl Bruggeman
Venue:In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation
Citations:70 - 11 self

Documents Related by Co-Citation

595 Compiling with Continuations – Andrew Appel - 1992
190 ORBIT: An optimizing compiler for Scheme – D KRANZ, R KELSEY, J REES, P HUDAK, J PHILBIN, N ADAMS - 1986
1497 The Definition of Standard ML – Robin Milner, Mads Tofte, Robert Harper - 1990
107 Continuation-passing, closure-passing style – Trevor Jim - 1989
103 Garbage Collection Can Be Faster Than Stack Allocation – Andrew W. Appel - 1987
125 The Design and Evaluation of a High Performance Smalltalk System. ACM distinguished dissertation – David M Ungar - 1986
89 Revised Report on the Algorithmic Language Scheme – J Rees, W Clinger - 1986
192 Standard ML of New Jersey – Andrew W. Appel, David B. Macqueen - 1991
215 A nonrecursive list compacting algorithm – C J Cheney - 1970
170 Simple Generational Garbage Collection and Fast Allocation – Andrew W. Appel - 1988
47 The SIMPLE code – W P Crowley, C P Hendrickson, T E Rudy - 1978
107 Elements of Functional Programming – Chris Reade - 1989
36 The Effect of Garbage Collection on Cache Performance – Benjamin Zorn - 1991
52 Caching Considerations for Generational Garbage Collection – Paul Wilson, Michael S. Lam, Thomas G. Moher - 1992
21 Efficient stack allocation for tail-recursive languages – Chris Hanson - 1990
299 The mechanical evaluation of expressions – P J Landin - 1964
100 Performance and Evaluation of Lisp Systems – Richard P. Gabriel - 1985
15 Memory Allocation and Higher-Order Functions – Olivier Danvy - 1987
122 Cache Write Policies and Performance – Norman P. Jouppi - 1991