Algol-like Languages

  • Peter W. O’Hearn
  • Robert D. Tennent

Part of the Progress in Theoretical Computer Science book series (PTCS)

Table of contents

  1. Front Matter
    Pages i-vii
  2. Functor-Category Semantics

    1. Front Matter
      Pages 1-1
    2. Frank J. Oles
      Pages 3-12
  3. Specification Logic

    1. Front Matter
      Pages 39-39
    2. Robert D. Tennent
      Pages 41-64
    3. Peter W. O’Hearn, Robert D. Tennent
      Pages 65-93
  4. Procedures and Local Variables

    1. Front Matter
      Pages 95-95
    2. Peter W. O’Hearn, Robert D. Tennent
      Pages 109-163
  5. Interference, Irreversibility, and Concurrency

    1. Front Matter
      Pages 187-187
    2. Peter W. O’Hearn, A. John Power, Makoto Takeyama, Robert D. Tennent
      Pages 189-225
    3. Stephen Brookes
      Pages 331-348
  6. Back Matter
    Pages 349-349

About this book


To construct a compiler for a modern higher-level programming languagel one needs to structure the translation to a machine-like intermediate language in a way that reflects the semantics of the language. little is said about such struc­ turing in compiler texts that are intended to cover a wide variety of program­ ming languages. More is said in the Iiterature on semantics-directed compiler construction [1] but here too the viewpoint is very general (though limited to 1 languages with a finite number of syntactic types). On the other handl there is a considerable body of work using the continuation-passing transformation to structure compilers for the specific case of call-by-value languages such as SCHEME and ML [21 3]. ln this paperl we will describe a method of structuring the translation of ALGOL-like languages that is based on the functor-category semantics devel­ oped by Reynolds [4] and Oles [51 6]. An alternative approach using category theory to structure compilers is the early work of F. L. Morris [7]1 which anticipates our treatment of boolean expressionsl but does not deal with procedures. 2 Types and Syntax An ALGOL-like language is a typed lambda calculus with an unusual repertoire of primitive types. Throughout most of this paper we assume that the primi­ tive types are comm(and) int(eger)exp(ression) int(eger)acc(eptor) int(eger)var(iable) I and that the set 8 of types is the least set containing these primitive types and closed under the binary operation -.


ALGOL Computer Languages ML Turing Variable calculus code compiler compiler construction lambda calculus logic programming language semantics

Editors and affiliations

  • Peter W. O’Hearn
    • 1
  • Robert D. Tennent
    • 2
  1. 1.Dept. of Computer ScienceQueen Mary & Westfield CollegeEngland
  2. 2.Dept. of Computing and Information ScienceQueen’s UniversityKingstonCanada

Bibliographic information