Logic in Computer Science (LICS 1999)

Paper: Region Analysis and the Polymorphic Lambda Calculus (at LICS 1999)

Authors: Anindya Banerjee Nevin Heintze Jon G. Riecke

Abstract

We show how to translate the region calculus of Tofte and Talpin, 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.

BibTeX

  @InProceedings{BanerjeeHeintzeRiec-RegionAnalysisandth,
    author = 	 {Anindya Banerjee and Nevin Heintze and Jon G. Riecke},
    title = 	 {Region Analysis and the Polymorphic Lambda Calculus},
    booktitle =  {Proceedings of the Fourteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1999},
    year =	 1999,
    editor =	 {Giuseppe Longo},
    month =	 {July}, 
    pages =      {88--97},
    location =   {Trento, Italy}, 
    publisher =	 {IEEE Computer Society Press}
  }