Reference Counting as a Computational Interpretation of Linear Logic (1996)
| Venue: | Journal of Functional Programming |
| Citations: | 32 - 0 self |
BibTeX
@ARTICLE{Chirimar96referencecounting,
author = {Jawahar Chirimar and Carl A. Gunter and Jon G. Riecke},
title = {Reference Counting as a Computational Interpretation of Linear Logic},
journal = {Journal of Functional Programming},
year = {1996},
volume = {6},
pages = {6--2}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We develop formal methods for reasoning about memory usage at a level of abstraction suitable for establishing or refuting claims about the potential applications of linear logic for static analysis. In particular, we demonstrate a precise relationship between type correctness for a language based on linear logic and the correctness of a reference-counting interpretation of the primitives that the language draws from the rules for the `of course' operation. Our semantics is `low-level' enough to express sharing and copying while still being `highlevel ' enough to abstract away from details of memory layout. This enables the formulation and proof of a result describing the possible run-time reference counts of values of linear type. Contents 1 Introduction 1 2 Operational Semantics with Memory 4 3 A Programming Language Based on Linear Logic 9 4 Semantics 14 5 Properties of the Semantics 24 6 Linear Logic and Memory 27 7 Discussion 32 A Proofs of the Main Theorems 36 Acknowledgements...
