Region Analysis and the Polymorphic Lambda Calculus

Authors:
Anindya Banerjee;Nevin Heintze;Jon G. Riecke
Affiliations:
-;-;-
Venue:
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Year:
1999

Citing 0
Cited 18

Stratified operational semantics for safety and correctness of the region calculus

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-preserving garbage collectors

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Syntactic type soundness results for the region calculus

Information and Computation
From control effects to typed continuation passing

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Prototype Dependency Calculus

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Region Analysis and a pi-Calculus wiht Groups

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Monads and Effects

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Region analysis and a π-calculus with groups

Journal of Functional Programming
Heap-Bounded Assembly Language

Journal of Automated Reasoning
A Retrospective on Region-Based Memory Management

Higher-Order and Symbolic Computation
Polymorphic specialization for ML

ACM Transactions on Programming Languages and Systems (TOPLAS)
Monadic regions

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Bisimilarity for the Region Calculus

Higher-Order and Symbolic Computation
Monadic regions

Journal of Functional Programming
Relational semantics for effect-based program transformations with dynamic allocation

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Bunching for Regions and Locations

Electronic Notes in Theoretical Computer Science (ENTCS)
Typing safe deallocation

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Reading, writing and relations: towards extensional semantics for effect analyses

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

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.