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:
On modal logic:
Last revised on August 25, 2026 at 04:04:03. See the history of this page for a list of all contributions to it.