Dana Stewart Scott

Born October 11, 1932, Berkeley, Calif.; logician; joint creator with Christopher Strachey of a theoretical system for the study of program properties and language definitions--denotational semantics; joint recipient of the 1976 ACM Turing Award with Michael Rabin.

Education: BA, University of California, Berkeley, 1954; PhD, Princeton University, 1958.

Professional Experience: instructor, University of Chicago, 1958-1960; assistant professor of mathematics, University of California, Berkeley, 1960-1962; associate professor of mathematics, University of California, Berkeley, 1962-1963; associate professor of logic and mathematics, Stanford University, 1963-1967; professor of logic and mathematics, Stanford University, 1967-1969; visiting professor of mathematics, University of Amsterdam, 1968-1969; professor of philosophy and mathematics, Princeton University, 1969-1972; professor of mathematical logic, Oxford University, 1972-1981; University professor of computer science, mathematical logic, and philosophy, Carnegie Mellon University, 1981-present (on leave); Hillman Professor of Computer Science, Carnegie Mellon University, 1989-present (on leave); Osterreich University Professor, symbolic computation and logic, University of Linz, 1992-present.

Honors and Awards: Bell Telephone fellow, Princeton University, 1956-1957; Miller Institute fellow, University of California, Berkeley, 1960-1961; Alfred P. Sloan research fellow, 1963-1965; Guggenheim Foundation fellow, 1978-1979; visiting scientist, Xerox Palo Alto Research Center, 1978-1979; professorial fellow, Merton College, Oxford, 1972-1981; LeRoy P. Steele Prize, American Mathematical Society, 1972; Turing Award, Association for Computing Machinery (with Michael Rabin), 1976; Drhc, Rijksuniversiteit Utrecht, the Netherlands, 1986; Harold Pender Award, University of Pennsylvania, 1990; Academy Fellowships: American Association for the Advancement of Science, American Academy of Arts and Sciences, British Academy, Finnish Academy of Sciences and Letters, New York Academy of Sciences, US National Academy of Sciences; fellow, ACM, 1994.

Dana Scott's work in logic has concerned the theories of models, automata, and sets, modal and intuitionistic logic, constructive mathematics, and connections between category theory and logic. His interests in philosophy concern the foundations and philosophy of logic and mathematics and the semantical analysis of natural language. Scott's work in computer science has been directed principally toward the development of denotational semantics of programming languages and the mathematical foundations of a suitable theory of computability. His current projects aim at unifying the semantical approach with constructive logical formalisms to be able to give rigorous and machine-implementable proof methods and development tools for the inferential construction of correct programs. Part of the technique is based on modeling computational structures as partially ordered sets in special categories enjoying extensive closure conditions (the theory of domains). Other current projects involve work in information retrieval, electronic publishing (and generally studies on the structure of electronic text), computational linguistics, and computer algebra. Scott has supervised 36 PhD theses within this range of subjects.


"Learn as much as you can while you are young, since life becomes too busy later."

"Try to regard mathematics as an experimental science."


Significant Publications

Scott, Dana, and J. Kalicki, "Equational Completness of Abstract Algebras," Koninkl. Nederl. Akademie van Wetenschappen, Proceedings, Series A, Vol. 58, 1955, pp. 650-659.

Scott, Dana, and A. Tarski, "The Sentential Calculus with Infinitely Long Expressions," Colloquium Mathematicum, Vol. 6, 1958, pp. 165-170.

Scott, Dana, and Patrick Suppes, "Foundational Aspects of Theories of Measurement," J Symbolic Logic, Vol. 23, 1958, pp. 113-128.

Scott, Dana, "Existence and Description in Formal Logic," in Schoenman, R., ed., Bertrand Russell. Philosopher of the Century, George Allen & Unwin, London, 1967, pp. 181-200.

Scott, Dana, "Some Definitional Suggestions for Automata Theory," Computer and System Sciences, Vol. 1, 1967, pp. 187-212.

Scott, Dana, "Outline of a Mathematical Theory of Computation," Proc. Fourth Annual Princeton Conference on Information Sciences and Systems, 1970, pp. 169-176.

Scott, Dana, "The Lattice of Flow Diagrams," in Engeler, E., ed., Semantics of Algorithmic Languages, Springer-Verlag, Berlin, Vol. LNM 188, 1971, pp. 311-368.

Scott, Dana, and C. Strachey, "Toward a Mathematical Semantics for Computer Languages," Proceedings of the Symposium on Computers and Automata, Polytechnic Press, Brooklyn, N.Y., Microwave Research Institute Symposia Series, Vol. 21, 1971, pp. 19-46.

Scott, Dana, "Lattice Theory, Data Types and Semantics," in Rustin, R., ed., Formal Semantics of Programming Languages, Prentice Hall, Courant Computer Science Symposia, Vol. 2, 1972, pp. 65-106.

Scott, Dana, "Continuous Lattices," in Lawvere, F.W., ed., Toposes, Algebraic Geometry and Logic, Springer-Verlag, Berlin, Vol. LNM 274, 1972, pp. 97-136.

Scott, Dana, "Mathematical Concepts in Programming Language Semantics," AFIPS Conference Proc., AFIPS Press, Montvale, NJ., Vol. 40, 1972, pp. 225-234.

Scott, Dana, "Axiomatizing Set Theory," in Jech, T.J., ed., Proc. Symposia in Pure Mathematics, American Mathematical Society, Providence, R.I., Vol. 13, Part 2, 1974, pp. 207-214.

Scott, Dana, "Data Types as Lattices," Proc. Intl Summer Institute and Logic Colloquium, Muller, G., et al., eds., Springer-Verlag, Keil, Vol. LNM 499, 1975, pp.579-651.

Scott, Dana, "Logic and Programming Languages," Comm. ACM, Vol. 20, 1975, pp.634-641.

Scott, Dana, "Relating Theories of the Lambda-Calculus," in Seldin, J.P., and J.R. Hindley, eds., To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, New York, 1980, pp. 403-450.

Scott, Dana, "Domains for Denotational Semantics," in Nielsen, M., and E.M. Schmidt, eds., Automata, Languages and Programming, Springer-Verlag, Vol. LNCS 140, 1982, pp. 577-610.

Scott, Dana, and C. A. Gunter, "Semantic Domains," in Van Leeuwenjan, ed., Handbook of Theoretical Computer Science; Formal Models and Semantics, Vol. B, Elsevier/MIT Press, 1980, pp. 633-674.


Portrait added (MRW, 2013)

PDF version

Original content Copyright © 1995 by the Institute of Electrical and Electronics Engineers Inc.
New content Copyright © 2013-2015 by the IEEE Computer Society and the Institute of Electrical and Electronics Engineers Inc.
All rights reserved. This material may not be reproduced or redistributed without the express written permission of the copyright holder.