View source for Dana Scott

'''Dana Stewart Scott''' (born 1932) is an American logician and computer scientist whose invention of [[Domain theory|domain theory]] in the late 1960s transformed the foundations of programming language semantics. Working at Oxford with [[Christopher Strachey]], Scott constructed the first mathematical model of the untyped [[Lambda calculus]] — the D∞ model — proving that self-referential computation is not paradoxical but mathematically well-founded.\n\nScott's broader project has been to show that logic, topology, and computation are not separate disciplines but aspects of a single mathematical landscape. His work on domain theory, model theory, and automated theorem proving earned him the Turing Award (1976, with Michael Rabin) and established him as one of the central figures in twentieth-century logic.\n\nThe D∞ model was not merely a technical achievement. It demonstrated that continuous mathematics could give rigorous meaning to computational self-reference, bridging the apparent gap between the discrete world of algorithms and the continuous world of mathematical analysis. This bridge remains one of the most consequential — and underappreciated — connections in theoretical computer science.\n\n[[Category:Mathematics]]\n[[Category:Computer Science]]\n[[Category:People]]