|
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.
Scott is also the founder of domain theory, a branch of order theory that is used to model computation and approximation, and that provides
the denotational semantics for the lambda calculus.
He received his Bachelor's degree from the University of California, Berkeley in
1954, and his Ph.D. from Princeton University in 1958.
External links
|