DEFINITIONAL INTERPRETERS 397
12. Scott, Dana S. Outline of a mathematical theory of computation. Technical Monograph PRG–2, Program-
ming Research Group, Oxford University Computing Laboratory, Oxford, England, November 1970. A
preliminary version appeared in Proceedings of the Fourth Annual Princeton Conference on Information
Sciences and Systems (1970), 169–176.
13. Scott, Dana S. Lattice theory, data types and semantics. In Randell Rustin, editor, Formal Semantics of
Programming Languages: Courant Computer Science Symposium 2, pages 65–106, New York University,
New York, September 14–16, 1970. Prentice-Hall, Englewood Cliffs, New Jersey, 1972.
14. Scott, Dana S. Models for various type-free calculi. In Patrick Suppes, Leon Henkin, Athanase Joja,
and Gr. C. Moisil, editors, Logic, Methodology and Philosophy of Science IV: Proceedings of the Fourth
International Congress, volume 74 of Studies in Logic and the Foundations of Mathematics, pages 157–187,
Bucharest, Romania, August 29–September 4, 1971. North-Holland, Amsterdam, 1973.
15. Scott, Dana S. Continuous lattices. In F. William Lawvere, editor, Toposes, Algebraic Geometry and Logic,
volume 274 of Lecture Notes in Mathematics, Dalhousie University, Halifax, Nova Scotia, January 16–19,
1971. Springer-Verlag, Berlin, 1972.
16. Milner, Robin. Implementation and applications of Scott’s logic for computable functions. In Proceedings of
an ACM Conference on Proving Assertions about Programs, pages 1–6, Las Cruces, New Mexico, January
6–7, 1972. ACM, New York. SIGPLAN Notices Volume 7, Number 1 and SIGACT News, Number 14.
17. Burstall, Rodney M. Formal description of program structure and semantics in ﬁrst order logic. In Bernard
Meltzer and Donald Michie, editors, Machine Intelligence 5, pages 79–98. Edinburgh University Press,
Edinburgh, Scotland, 1969.
18. Lucas, Peter, Lauer, Peter E., and Stigleitner, H. Method and notation for the formal deﬁnition of program-
ming languages. Technical Report TR 25.087, IBM Laboratory Vienna, June 28, 1968. Revised July 1,
19. Reynolds, John C. GEDANKEN – a simple typeless language which permits functional data structures and
coroutines. Report ANL–7621, Applied Mathematics Division, Argonne National Laboratory, Argonne,
Illinois, September 1969.
20. Morris, F. Lockwood. The next 700 formal language descriptions. Lisp and Symbolic Computation, 6(3–
4):249–257, November 1993. Original manuscript dated November 1970.
21. de Bakker, Jaco W. Semantics of programming languages. In Julius T. Tou, editor, Advances in Information
Systems Science, volume 2, chapter 3, pages 173–227. Plenum Press, New York, 1969.
22. Park, David M. R. Fixpoint induction and proofs of program properties. In Bernard Meltzer and Donald
Michie, editors, Machine Intelligence 5, pages 59–78. Edinburgh University Press, Edinburgh, 1969.
23. Feldman, Jerome and Gries, David. Translator writing systems. Communications of the ACM, 11(2):77–113,
24. McCarthy, John. Towards a mathematical science of computation. In Cicely M. Popplewell, editor, Infor-
mation Processing 62: Proceedings of IFIP Congress 1962, pages 21–28, Munich, August 27–September
1, 1962. North-Holland, Amsterdam, 1963.
25. Wozencraft, John M. and Evans, Jr., Arthur. Noteson programming linguistics. Technical report, Department
of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts, February
26. van Wijngaarden, Adriaan . Recursive deﬁnition of syntax and semantics. In T. B. Steel, Jr., editor,
Formal Language Description Languages for Computer Programming: Proceedings of the IFIP Working
Conference on Formal Language Description Languages, pages 13–24, Baden bei Wien, Austria, September
15–18, 1964. North-Holland, Amsterdam, 1966.
27. Morris, Jr., James H. A bonus from van Wijngaarden’s device. Communications of the ACM, 15(8):773,
28. Fischer, Michael J. Lambda calculus schemata. In Proceedings of an ACM Conference on Proving Assertions
about Programs, pages 104–109, Las Cruces, New Mexico, January 6–7, 1972. ACM, New York.
29. Landin, Peter J. A correspondence between ALGOL 60 and Church’s lambda-notation. Communications
of the ACM, 8(2–3):89–101, 158–165, February–March 1965.
30. Barron, D.W., Buxton, John N., Hartley, D.F., Nixon, E., and Strachey, Christopher. The main features of
CPL. The Computer Journal, 6:134–143, July 1963.
31. van Wijngaarden,Adriaan, Mailloux, B.J., Peck, J.E.L., and Koster, C.H.A. Report on the algorithmic
language ALGOL 68. Numerische Mathematik, 14(2):79–218, 1969.
32. Cheatham, Jr., T.E., Fischer, Alice, and Jorrand, P. On the basis for ELF – an extensible language facility.
In 1968 Fall Joint Computer Conference, volume 33, Part Two of AFIPS Conference Proceedings, pages
937–948, San Francisco, December 9–11, 1968. Thompson Book Company, Washington, D.C.