b. 1932
Dana Scott (born 1932) is an American logician and computer scientist whose work spans mathematical logic, modal logic, and the foundations of programming languages. He is best known for co-developing Scott-Montague semantics for modal logic and for founding domain theory, which provided the first rigorous mathematical semantics for the lambda calculus. His contributions have been foundational to both formal philosophy and theoretical computer science.
Co-developed Scott-Montague possible-worlds semantics for modal logic
Founded domain theory, enabling denotational semantics for programming languages
Proved (with Michael Rabin) the undecidability of various automata-theoretic problems
Developed continuous lattices and the Scott topology
Awarded the Turing Award (1976) for contributions to automata theory and programming language semantics