(Enter summary)
Abstract: We show how to translate the region calculus of Tofte and Talpin, a typed lambda calculus which can statically delimit the lifetimes of objects, into an extension of the polymorphic lambda calculus called F # . We give a denotational semantics of F # , and use it to give a simple and abstract proof of correctness of memory deallocation. (Update)
Context of citations to this paper: More
...is being referred to as the tt calculus. Whereas type soundness properties for region calculi have been extensively examined [5, 8, 10, 53, 58], little attention has been paid to the development of a semantic framework to reason about region annotated programs. In this...
...had no poly morphism, we would still have answer type polymorphism in the target of the CPS transform. Banerjee, Heintze and Riecke [3] encode Tofte and Talpin s [27] region calculus into a polymorphic A calculus. It remains to be seen whether their approach could be...
Cited by: More
Heap Bounded Assembly Language - Aspinall, Compagnoni (2003)
(Correct)
Semantic and Logical Properties of Stateful Programming - Calcagno (2002)
(Correct)
From Control Effects to Typed Continuation Passing - Thielecke (2003)
(Correct)
Similar documents (at the sentence level):
60.0%: Region Analysis and the Polymorphic Lambda Calculus - Banerjee, Heintze, Riecke (1999)
(Correct)
Active bibliography (related documents): More All
0.3: Garbage Collection Based on a Linear Type System - Igarashi, Kobayashi (2000)
(Correct)
0.3: the Garbage Collection Bibliography - Richard Jones (2003)
(Correct)
0.2: Foundational Proof-Carrying Code - Appel (2001)
(Correct)
Similar documents based on text: More All
0.5: An Equational Theory for a Region Calculus - Helsen (2002)
(Correct)
0.3: Design and Correctness of Program Transformations Based.. - Banerjee, Heintze.. (2001)
(Correct)
0.2: Syntactic Type Soundness Results for the Region Calculus - Calcagno, Helsen, Thiemann
(Correct)
Related documents from co-citation: More All
16: Region-based memory management
- Tofte, Talpin - 1997
15: ACM Transactions on Programming Languages and Systems (context) - Tofte, Birkedal et al. - 1998
13: A constraint-based region inference algorithm
- Birkedal, Tofte - 1999
BibTeX entry: (Update)
Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. Region analysis and the polymorphic lambda calculus. In Proc. of the 14th Annual IEEE symposium on Logic in Computer Science, Trento, Italy, July 1999. IEEE Computer Society Press. http://citeseer.ist.psu.edu/banerjee99region.html More
@inproceedings{ banerjee99region,
author = "Anindya Banerjee and Nevin Heintze and Jon G. Riecke",
title = "Region Analysis and the Polymorphic Lambda Calculus",
booktitle = "Logic in Computer Science",
pages = "88-97",
year = "1999",
url = "citeseer.ist.psu.edu/banerjee99region.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1997
325
Towards a theory of type structure (context) - Reynolds - 1974
306
LCF considered as a programming language (context) - Plotkin - 1977
262
Uniprocessor garbage collection techniques
- Wilson - 1992
188
Region-based memory management
- Tofte, Talpin - 1997
150
The category-theoretic solution of recursive domain equation.. (context) - Smyth, Plotkin - 1982
147
abstraction and parametric polymorphism (context) - Reynolds - 1983
121
A core calculus of dependency
- Abadi, Banerjee et al. - 1999
117
Typed memory management in a calculus of capabilities
- Crary, Walker et al. - 1999
99
Polymorphic effect systems (context) - Lucassen, Gifford - 1988
83
From region inference to von Neumann machines via region rep..
- Birkedal, Tofte et al. - 1996
81
The theory and practice of first-class prompts (context) - Felleisen - 1988
61
Une extension de l'interpretation de Godel a l'analyse (context) - Girard - 1971
58
Better static memory management: Improving region-based anal..
- Aiken, Fahndrich et al. - 1995
42
The Lazy Lambda Calculus: An Investigation into the Foundati.. (context) - Ong - 1988
42
A PER model of polymorphism and recursive types
- Abadi, Plotkin - 1990
28
region and effect inference (context) - Talpin, Jouvelot - 1992
26
From Algol to polymorphic linear lambda calculus
- O'Hearn, Reynolds - 1998
16
Collecting more garbage
- Fradet - 1994
5
Implementation of the typed call-by-value l-calculus using a.. (context) - Tofte, Talpin - 1994
4
Garbage collection via dynamic type inference --- a formal t..
- Hosoya, Yonezawa - 1998
2
Programming Languages and Systems (context) - Tofte, Birkedal et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://guinness.cs.stevens-tech.edu/~ab/bib.html): More
A Categorical Interpretation of Landin's Correspondence.. - Banerjee, Schmidt (1993)
(Correct)
The Semantics and Implementation of Bindings in Higher-Order.. - Banerjee (1995)
(Correct)
Stackability in the Simply-Typed Call-By-Value Lambda Calculus - Banerjee, Schmidt
(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