Editing Dana Scott (section)

==University of Oxford, 1972–1981==
Scott took up a post as Professor of Mathematical Logic on the Philosophy faculty of the [[University of Oxford]] in 1972. He was member of [[Merton College, Oxford|Merton College]] while at Oxford and is now an Honorary Fellow of the college.

===Semantics of programming languages===
This period saw Scott working with [[Christopher Strachey]], and the two
managed, despite administrative pressures,{{Clarify|reason=vague|date=May 2017}} to do work on providing a mathematical foundation for the semantics of programming languages, the work for which Scott is best known{{opinion|date=January 2016}}. Together, their work constitutes the Scott–Strachey approach to [[denotational semantics]], an important and seminal contribution to [[theoretical computer science]]. One of Scott's contributions is his formulation of [[domain theory]], allowing programs involving recursive functions and looping-control constructs to be given denotational semantics. Additionally, he provided a foundation for the understanding of infinitary and continuous information through domain theory and his theory of [[Scott information system|information systems]].

Scott's work of this period led to the bestowal of:
* The 1990 [[Harold Pender Award]] for his ''application of concepts from logic and algebra to the development of mathematical semantics of programming languages'';
* The 1997 [[Rolf Schock Prize]] in logic and philosophy from the [[Royal Swedish Academy of Sciences]] for ''his conceptually oriented logical works, especially the creation of domain theory, which has made it possible to extend Tarski's semantic paradigm to programming languages as well as to construct models of Curry's combinatory logic and Church's calculus of lambda conversion''; and
* The 2001 [[Bolzano Prize]] for Merit in the Mathematical Sciences by the [[Czech Academy of Sciences]]
* The 2007 [[EATCS]] Award for his contribution to theoretical computer science.