Scott's domain theory
- lambda calculus
- logic
Dana Scott’s domain-theoretic work around 1969 supplied mathematical models for the untyped lambda calculus using ordered structures and continuous functions. Approximation and fixed points made recursive computation interpretable within a carefully constructed semantic setting. This addressed a foundational question: how could functions that apply to themselves receive a coherent mathematical interpretation? Domain theory also became important in denotational semantics for programming languages. Its notion of continuity concerns order-theoretic information and should not be confused automatically with ordinary real-variable continuity. **Timeline anchor:** 1 January 1969 CE. Developed 1969–1970. **References:** [Source 1](https://en.wikipedia.org/wiki/Domain_theory), [Source 2](https://en.wikipedia.org/wiki/Dana_Scott).
Sources
On other timelines
- Scott develops a type-theoretical alternative for computable functions on Type theory · foundations, languages, proof assistants and program logics by @athan