nLab Dana Scott

• Homepage

• Wikipedia page

• Scans of selected papers

• Peripatetic Seminar on Sheaves and Logic (History)

Selected writings

On the theory of computation and introducing the notion of denotational semantics of programming languages by what came to be called domain theory:

• Dana S. Scott, Outline of a mathematical theory of computation, in: Proceedings of the Fourth Annual Princeton Conference on Information Sciences and Systems (1970) 169–176. [pdf, pdf]

• Dana S. Scott, Christopher Strachey, Toward a Mathematical Semantics for Computer Languages, Oxford University Computing Laboratory, Technical Monograph PRG-6 (1971) [pdf, pdf]

• Dana Scott, Data types as lattices. SIAM Journal of Computing 5 3 (1976) 522–587 [doi:10.1137/0205037, pdf]

• G. Gierz, Karl H. Hofmann, K. Keimel, J. D. Lawson, Michael W. Mislove, Dana S. Scott, Continuous Lattices and Domains in Encyclopedia of Mathematics and its Applications 93, Cambridge University Press (2003) [doi:10.1017/CBO9780511542725]

On models of the lambda calculus, cartesian closed categories, and idempotent splitting:

• Dana S. Scott, Relating theories of the lambda calculus, in: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press (1980) 403–450 [pdf]

On modal logic:

• E. John Lemmon with Dana Scott, An Introduction to Modal Logic – The “Lemmon Notes”, B. Blackwell (1977) [ark:/13960/t3gz25k3h]

On measurable cardinals and constructible sets in set theory:

• Dana Scott: Measurable cardinals and constructible sets, Bulletin de l’ Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 9 (1961), pp. 521–524. [pdf]

Related entries

• domain theory

• Scott's trick

• equilogical space

• Scott topology

• lambda-calculus

• reflexive object

category: people