H N Y 9 7 3 4 8 :

643 Dana Scott

us
us
web page
Dana S. Scott is the incumbent Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University. His contributions include early work in automata theory, for which he received the ACM Turing Award in 1976, and the independence of the Boolean prime ideal theorem. His domain theory models computation and approximation.
He received his Bachelor's degree from the University of California, Berkeley in 1954, and his Ph.D from Princeton University in 1958.

Languages:

References:

  • Scott Dana (1964) Scott Dana "Outline of a mathematical theory of computation"  E A
          in Proc. (1970) Proc. 4th Ann. Princeton Conf. on Information Sciences and Systems (1970)  E
  • Scott, Dana and Strachey, Christopher (1966) Scott, Dana and Strachey, Christopher "Toward a mathematical semantics for computer languages"  E A
          in Proc. (1971) Proc. Symp. on Computers and Automata vol. 21 (1971)  E
  • Scott, Dana; (1969) Scott, Dana; "A Type-Theoretical Alternative to CUCH, ISWIM, OWHY", Oxford U 1969.  E A
          in Proc. (1971) Proc. Symp. on Computers and Automata vol. 21 (1971)  E
  • Scott, Dana (1971) Scott, Dana "Outline of a Mathematical Theory of Computation", TM PRG-2, PRG, Oxford U, 1971.  E A Page at OUP Abstract
          in Proc. (1971) Proc. Symp. on Computers and Automata vol. 21 (1971)  E
  • Scott, D., (1976) Scott, D., "Data Types as Lattices", SIAM J.Comput 5, pp.523-587, (1976).  E A
          in Proc. (1971) Proc. Symp. on Computers and Automata vol. 21 (1971)  E
  • Scott, Dana (2000) Scott, Dana "Some Reflections on Strachey and His Work"  E A
          in (2000) Higher-Order and Symbolic Computation April 2000 Volume 13 Issue 1-2  E