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:76 - 11 self

Documents Related by Co-Citation

625 Compiling With Continuations – A W Appel - 1992
195 ORBIT: An optimizing compiler for Scheme – David Kranz, Richard Kelsey, Jonathan Rees, Paul Hudak, James Philbin, Norman Adams - 1987
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
111 Continuation-passing, closure-passing style – Trevor Jim - 1989
108 Garbage Collection Can Be Faster Than Stack Allocation – Andrew W. Appel - 1987
126 The Design and Evaluation of a High Performance Smalltalk System – David Michael Ungar - 1987
90 Revised report on the algorithmic language scheme – J Rees, W Clinger - 1986
195 Standard ML of New Jersey – Andrew W. Appel, David B. Macqueen - 1991
235 A nonrecursive list compacting algorithm – C J Cheney - 1970
110 Elements of Functional Programming – C Reade - 1989
49 The simple code – W P Crowley, C P henderson, T E Rudy - 1978
185 Simple Generational Garbage Collection and Fast Allocation – Andrew W. Appel - 1988
38 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
128 A Case for Direct-Mapped Caches – M D Hill - 1988
333 The mechanical evaluation of expressions – P J Landin - 1964
105 Performance and Evaluation of Lisp Systems – Richard P. Gabriel - 1985
23 Efficient stack allocation for tail-recursive languages – C Hanson - 1990
15 Memory allocation and higher-order functions – Olivier Danvy - 1987