(Enter summary)
Abstract: By combining existing type systems with standard typebased compilation techniques, we describe how to write strongly typed programs that include a function that acts as a tracing garbage collector for the program. Since the garbage collector is an explicit function, we do not need to provide a trusted garbage collector as a runtime service to manage memory. Since our language is strongly typed, the standard type soundness guarantee \Well typed programs do not go wrong" is extended to include... (Update)
Cited by: More
Linear Regions Are All You Need - Fluet, Morrisett, Ahmed
(Correct)
Checking and Inferring Local Non-Aliasing - Alex Aiken Aiken (2003)
(Correct)
Implementation and Performance Evaluation of a Safe Runtime.. - Fluet, Wang (2004)
(Correct)
Active bibliography (related documents): More All
3.1: Type-Preserving Garbage Collectors - Wang, Appel (2001)
(Correct)
0.4: Safe Programming at the C Level of Abstraction - Grossman (2003)
(Correct)
0.4: the Garbage Collection Bibliography - Richard Jones (2003)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.1: Real-time Concurrent Collection on Stock Multiprocessors - Appel, Ellis, Li (1988)
(Correct)
0.1: A Type-Based Compiler for Standard ML - Shao, Appel (1994)
(Correct)
0.1: Age-Based Garbage Collection - Stefanovic, McKinley, Moss (1998)
(Correct)
Related documents from co-citation: More All
14: Region-based memory management
- Tofte, Talpin - 1997
11: Proof-carrying code
- Necula - 1997
10: Memory management with explicit regions
- Gay, Aiken - 1998
BibTeX entry: (Update)
Daniel C. Wang and Andrew W. Appel. Typepreserving garbage collectors (extend version). Technical Report TR-624-00, Princeton University, 2000. http://citeseer.ist.psu.edu/wang01typepreserving.html More
@article{ wang01typepreserving,
author = "Daniel C. Wang and Andrew W. Appel",
title = "Type-preserving garbage collectors",
journal = "ACM SIG{\-}PLAN Notices",
volume = "36",
number = "3",
pages = "166--178",
year = "2001",
url = "citeseer.ist.psu.edu/wang01typepreserving.html" }
Citations (may not include all citations):
566
Proof-carrying code
- Necula - 1997 ACM DBLP
201
to typed assembly language (context) - Morrisett, Walker et al. - 1998
190
How to make adhoc polymorphism less ad-hoc
- Wadler, Blott - 1989
186
Compiling polymorphism using intensional type analysis
- Harper, Morrisett - 1995 ACM DBLP
138
Typed closure conversion
- Minamide, Morrisett et al. - 1996 ACM DBLP
117
Typed memory management in a calculus of capabilities
- Crary, Walker et al. - 1999
86
Intensional polymorphism in type-erasure semantics
- Crary, Weirich et al.
85
Abstract models of memory management (context) - Morrisett, Felleisen et al. - 1995 ACM DBLP
82
Alias types for recursive data structures
- Walker, Morrisett - 2000 ACM DBLP
58
Better static memory management: Improving regionbased analy..
- Aiken, ahndrich et al. - 1995
58
Memory management with explicit regions
- Gay, Aiken - 1998
58
Java intermediate bytecodes (context) - Gosling - 1995 ACM
51
and Greg Morrisett (context) - Smith, Walker - 2000
44
Compiler support for garbage collection in a statically type..
- Diwan, Eliot et al. - 1992
41
From ML to Ada: Strongly-typed language interoperability via..
- Tolmach, Oliva - 1998 ACM DBLP
25
Typepreserving garbage collectors
- Wang, Appel - 2000
20
Region analysis and the polymorphic lambda calculus
- Banerjee, Heintze et al. - 1999
16
real-time garbage collection without motion sickness (context) - Baker - 1992
15
Look Ma, no garbage (context) - Baker, Lisp - 1992
11
Empirical and analytic study of stack versus heap cost for l.. (context) - Appel, Shao - 1996
10
Implementation of the typed call-by-value -calculus using a.. (context) - Tofte, Talpin - 1994
9
Recycling continuations
- Sobel, Friedman ACM DBLP
8
An ecient machine independent procedure for garbage collecti.. (context) - Schorr, Waite - 1967
8
Simple garbage-collector safety
- Boehm - 1996
6
The MM garbage collector for C (context) - Wang - 1989
5
The boyer benchmark meets linear logic
- Baker - 1993 ACM
3
Flow-directed lightweight closure conversion
- rey - 1999
3
Transformations de programmes recursifs (context) - Veillon - 1976
2
Technical Report Yale/DCS (context) - Monnier, Saha et al. - 2000
2
Programming with reigons in the ML Kit (context) - Tofte, Birkedal et al. - 1998
1
Ecent and safefor -space closure conversion (context) - Appel, Shao - 2000
The graph only includes citing articles where the year of publication is known.
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