Programming language semantics and closed applicative languages

ABSTRACT

This paper proposes axioms to define a sequence of language-classes; the most general is that of "programming language", the most restricted has some simple and attractive properties. Here "language" is used in its traditional sense as referring to a set of interpreted expressions. We are concerned with the syntax of an expression only to the degree needed to relate its structure to its "meaning". A clear distinction is drawn between a "language" and the many possible "realizations" of that language.This introduction comprises a survey and opinionated discussion of the contents of the paper, therefore the reader who wishes to get on with the technical exposition can skip to the next section.

REFERENCES

• 1: Scott, D. Lattice-theoretic models of the λ-calculus. {unpublished report?} Distributed to IFIP WG2.2
• 2: Alonzo Church, The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies), Princeton University Press, Princeton, NJ, 1985
• 3: John McCarthy, Recursive functions of symbolic expressions and their computation by machine, Part I, Communications of the ACM, v.3 n.4, p.184-195, April 1960 [doi>10.1145/367177.367199]
• 4: Backus, J. Reduction languages and variable-free programming. IBM Research Report RJ1010, Yorktown Heights, NY, April 7, 1972
• 5: Landin, P. J. The mechanical evaluation of expressions. The Computer Journal, Jan. 1964, 308-320.
• 6: Falkoff, A. D., and Iverson, K. E. APL/360 User's Manual. IBM, 1968