Denotational (Mathematical) Semantics

• Plotkin, G. D. LCF cosidered as a programming language. Theor. Comput. Sci. 5, 1977, 223-255.
• Schmidt, D. A. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, Newton, Mass., 1986.
• Scott, D. S. Domains for denotational semantics. In Proc. Int. Conf. on Automata, Languages, and Programming, Lecture Notes in Mathematics 140, Springer-Verlag, Berlin, 1982.

• Scott, D. S. Data Types as Lattices. SIAM J. Comput. 5, 1976, 522-587.
• Plotkin, G. T^omega as a Universal Domain. J. Comput. Sys. Sci. 17, 1978, 209-236.
• Stoy, J. E. Denotational Semantics: The Scott-Strachey Approach to Programming Languages. MIT Press, Cambridge, Mass., 1981.
• Strachey, C. Towards a formal semantics. In Formal Language Description Languages for Computer Programming, edited by T. B. Steel, 1966, 197-220.
• Strachey, C. and C. P. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, Programming Research Group, 1974.

Operational Semantics

Term Rewriting

• Klop, J. W. Term rewriting systems: a tutorial. Bull. EATCS 32, 1987, 143-182.

• Landin, P. J. The mechanical evaluation of expressions. Comput. J. 6(4), 1964, 308-320.

• Reynolds, J. C. Definitional interpreters for higher-order programming languages. In Proc. ACM Annual Conference, 1972, 717-740.

• Plotkin, G. D. Call-by-name, call-by-value, and the lambda-calculus. Theor. Comput. Sci. 1, 1975, 125-159.

• Plotkin, G. D. A structural approach to operational semantics. Technical Report FN-19, Aarhus University, Commputer Science Department, 1981.

• Cousineau, G., P.-L. Curien, M. Mauny. The categorical abstract machine. In Proc. Conf. Functional Programming, Nancy, 1985, 50-64.
• Turner, D. A. A new implementation technique for applicative languages. Softw. Pract. Exper. 9, 1979, 31-49.

• Barendregt, H. P. The Lambda Calculus: Its Syntax and Semantics rev. ed. Studies in Logic and the Foundations of Mathematics 103. North-Holland, Amsterdam, 1984. (Chapters 2, 3, 6, 7.)
• Landin, P. J. An abstract machine for designers of programming languages. In Proc. IFIP Congress, 1965, 438-439.
• Burge, W. Recursive Programming Techniques. Addison-Wesley, Reading, Mass., 1975. (Chapters 1.11, 2.)
• Huet, G., and D. C. Oppen. Equations and rewrite rules: a survey. In Formal Language Theory: Perspective and Open Problems, edited by R. Book, Academic Press, 1980, 349-405.

Axiomatic Semantics

• Floyd, R. W. Assigning meaning to programs. In Proc. Symp. in Applied Mathematics: Mathematical Aspects of Computer Science, 1967, 19-32.
• Hoare, C. A. R. An axiomatic basis for computer programming. Commun. ACM 12, 1969, 576-580.

Semantics of Types

• Reynolds, J. Towards a theory of type structure. Paris Colloquium on Programming, 1974, 408-424.
• MacQueen, D. and R. Sethi. A semantic model of types for applicative languages. In Proc. 1982 ACM Conf. on Lisp and Functional Programming, 1982, 243-252.
• MacQueen, D., R. Sethi, and G. Plotkin. An ideal model for recursive polymorphic types. In Proc. 11th ACM Symp. on Principles of Programming Languages, 1984, 165-174.
• Cartwright, R. Types as intervals. Technical Report TR84-5, Rice University Department of Computer Science, 1984.

Semantics of Data

• Cartwright, R. A constructive alternative to axiomatic data type definitions. In Proc. 1980 Conf. on Lisp and Functional Programming, 1980, 46-55.
• Goguen, J., J. Thatcher, E. Wagner. An initial algebra approach to the specification, correctness, and implementation of abstract data types. In Current Trends in Programming Methodology IV, edited by R. Yeh, Prentice-Hall, 1979, 80-149.
• Guttag, J. and J. Horning. The algebraic specification of abstract data types. Acta Inf. 10(1), 1978, 1-26.
• Kamin, S. Final data type specifications: A new data type specification method. In Proc. 7th Symp. on Principles of Programming Languages, 1980, 131-138.

Miscellaneous

• Lloyd, F. Foundations of Logic Programming, Springer-Verlag, 1985.