DocumentCode :
3596491
Title :
Region analysis and the polymorphic lambda calculus
Author :
Banerjee, Anindya ; Heintze, Nevin ; Riecke, Jon G.
Author_Institution :
Stevens Inst. of Technol., Hoboken, NJ, USA
fYear :
1999
fDate :
6/21/1905 12:00:00 AM
Firstpage :
88
Lastpage :
97
Abstract :
We show how to translate the region calculus of M. Tofte and J.P. Talpin (1997), a typed lambda calculus that 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 the correctness of memory deallocation
Keywords :
lambda calculus; programming language semantics; type theory; denotational semantics; memory deallocation correctness; polymorphic lambda calculus; region analysis; region calculus; typed lambda calculus; Calculus; Computer languages; Electrical capacitance tomography; Memory management;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 1999. Proceedings. 14th Symposium on
ISSN :
1043-6871
Print_ISBN :
0-7695-0158-3
Type :
conf
DOI :
10.1109/LICS.1999.782594
Filename :
782594
Link To Document :
بازگشت