Robert Hieb, R. Kent Dybvig, Carl Bruggeman  Home/Search
Context Related
Links: ACM DBLP | indiana.edu/l/www/proglang/p...stack.ps indiana.edu/~bruggema/papers...stack.ps indiana.edu/~dyb/papers/stack.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/l/www/proglang/ (more) From: ukans.edu/~665admin/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a heap has proven unsatisfactory because of increased frame linkage costs, increased garbage collection overhead, and decreased locality of reference. However, simply allocating activation records on a stack and copying them when a continuation is created results in unbounded copying overhead. This paper describes a new... (Update)
Context of citations to this paper: More
...than JAM and is slower than BEAM when processes enter the picture. We suspect that ETOS implementation of con currency via call cc [14] is not very efficient. As we move from benchmarks to real world applications of Erlang, programs tend to spend more and more of their...
Cited by: More
Lazy Threads: Implementing a Fast Parallel Call - Goldstein (1996) (Correct)
Efficient Implementation of Concurrent Programming Languages - Stenman (2002) (Correct)
Sharing Continuations: Proofnets for Languages with Explicit.. - Lawall, Mairson (2000) (Correct)
Similar documents (at the sentence level):
10.1%: Representing Control in the Presence of One-Shot.. - Bruggeman, Waddell, Dybvig (1996) (Correct)
Active bibliography (related documents): More All
0.6: Subcontinuations - Hieb, Dybvig, Anderson (1993) (Correct)
0.4: Revised^4 Report on the Algorithmic Language Scheme - Clinger, (ed.), Rees.. (1991) (Correct)
0.4: Threads Yield Continuations - Kumar, Bruggeman, Dybvig (1997) (Correct)
Similar documents based on text: More All
0.1: Syntactic Abstraction in Scheme - Dybvig, Hieb, Bruggeman (1993) (Correct)
0.1: Don't Stop the BIBOP: Flexible and Efficient Storage.. - Dybvig, Eby, Bruggeman (1994) (Correct)
0.1: A New Approach to Procedures with Variable Arity - Kent Dybvig (1990) (Correct)
Related documents from co-citation: More All
36: ORBIT: An Optimizing Compiler for Scheme (context) - Kranz - 1988
29: Compiling with Continuations (context) - Appel - 1992
16: The revised 4 report on the algorithmic language Scheme - Clinger, Rees - 1991
BibTeX entry: (Update)
Robert Hieb, R. Kent Dybvig, and Carl Bruggeman. Representing control in the presence of firstclass continuations. In Proceedings of the ACM SIGPLAN '90 Conference on Programming Languages Design and Implementation, pages 66--77, White Plains, New York, June 1990. http://citeseer.ist.psu.edu/hieb90representing.html More
@inproceedings{ hieb90representing,
author = "R. Hieb and R. K. Dybvig and C. Bruggerman",
title = "Representing control in the presence of first-class continuations",
booktitle = "Proceedings of the {ACM} {SIGPLAN} '90 Conference on Programming Language Design and Implementation",
journal = "SIGPLAN Notices",
volume = "25",
number = "6",
month = "June",
address = "White Plains, NY",
pages = "66--77",
year = "1990",
url = "citeseer.ist.psu.edu/hieb90representing.html" }
Citations (may not include all citations):484 Common LISP: The Language (context) - Jr - 1984
257 Smalltalk 80: the Language and its Implementation (context) - Goldberg, Robson - 1983
220 Orbit: An optimizing compiler for Scheme (context) - Kranz, Kelsey et al. - 1986
85 Garbage collection can be faster than stack allocation - Appel - 1987
35 Continuations and Concurrency (context) - Hieb, Dybvig - 1990 ACM DBLP
27 Implementation Strategies for Continuations (context) - Clinger, Hartheimer et al. - 1988
24 Scheme: an Interpreter for Extended Lambda Calculus (context) - Sussman, Jr - 1975
23 Engines from Continuations (context) - Dybvig, Hieb - 1988
18 Abstracting Timed Preemption with Engines (context) - Haynes, Friedman - 1987 ACM DBLP
14 Memory Allocation and HigherOrder Functions (context) - Danvy - 1987
13 The Revised 3 Report on the Algorithmic Language Scheme (context) - Rees, Clinger - 1986
13 Recursive Programming (context) - Dijkstra - 1967
12 The Implementation of PC Scheme (context) - Bartley, Jensen - 1986
9 Three Implementation Models for Scheme (context) - Dybvig - 1987 ACM
7 An Efficient Environment Allocation Scheme in an Interpreter.. (context) - McDermott - 1980
3 Obtaining Coroutines with Continuations (context) - Friedman, Haynes et al. - 1986 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/l/www/proglang/): More
Guardians in a Generation-Based Garbage Collector - Dybvig, Bruggeman, Eby (1993) (Correct)
Register Allocation Using Lazy Saves, Eager Restores, and .. - Burger, Waddell, Dybvig (1995) (Correct)
An Efficient Implementation of Multiple Return Values in Scheme - Ashley, Dybvig (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC