The semantics of local storage, or what makes the free-list free?(Preliminary Report)

  • Authors:
  • Joseph Y. Halpern;Albert R. Meyer;B. A. Trakhtenbrot

  • Affiliations:
  • IBM Research, San Jose;Laboratory for Computer Science, MIT;Dept. of Computer Science, Tel Aviv Univ.

  • Venue:
  • POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
  • Year:
  • 1984

Quantified Score

Hi-index 0.02

Visualization

Abstract

Denotational semantics for an ALGOL-like language with finite-mode procedures, blocks with local storage, and sharing (aliasing) is given by translating programs into an appropriately typed &lgr;-calculus. Procedures are entirely explained at a purely functional level - independent of the interpretation of program constructs - by continuous models for &lgr;-calculus. However, the usual (cpo) models are not adequate to model local storage allocation for blocks because storage overflow presents an apparent discontinuity. New domains of store models are offered to solve this problem.