A hierarchical graph model of the semantics of programs

  • Authors:

  • Terrence W. Pratt

  • Affiliations:

  • The University of Texas, Austin, Texas

  • Venue:
  • AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
  • Year:
  • 1969

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of developing an adequate formal model for the semantics of programming languages has been under intensive study in recent years. Unlike the area of syntax specification, where adequate models have existed for some time, the area of semantic specification is still in the formative stages. Development of formal semantic models has proceeded along two main lines, lambda-calculus models (e.g., Landin, Strachey) and directed graph models (e.g., Narasimhan, Floyd). This paper describes a model for the semantics of programs based on hierarchies of directed graphs.