Generalization of a Lemma of G. F. Rose. - I. L. Gal; J. Barkley Rosser; Dana S. Scott (J. Symb. Log., 1958)

Foundational Aspects of Theories of Measurement. - Dana S. Scott; Patrick Suppes (J. Symb. Log., 1958)

Finite Automata and Their Decision Problems. - Michael O. Rabin; Dana S. Scott (IBM J. Res. Dev., 1959)

Some Definitional Suggestions for Automata Theory. - Dana S. Scott (J. Comput. Syst. Sci., 1967)

A Proof of the Independence of the Continuum Hypothesis. - Dana S. Scott (Math. Syst. Theory, 1967)

The lattice of flow diagrams. - Dana S. Scott (Symposium on Semantics of Algorithmic Languages, 1971)

Mathematical concepts in programming language semantics. - Dana S. Scott (AFIPS Spring Joint Computing Conference, 1972)

Combinators and classes. - Dana S. Scott (Lambda-Calculus and Computer Science Theory, 1975)

Some philosophical issues concerning theories of combinators. - Dana S. Scott (Lambda-Calculus and Computer Science Theory, 1975)

Data Types as Lattices. - Dana S. Scott (SIAM J. Comput., 1976)

Logic and Programming Languages. - Dana S. Scott (Commun. ACM, 1977)

European Meeting of the Association for Symbolic Logic: Oxford, England, 1976. - Robin O. Gandy; Dana S. Scott (J. Symb. Log., 1977)

Domains for Denotational Semantics. - Dana S. Scott (ICALP, 1982)

First Steps Towards Inferential Programming. - William L. Scherlis; Dana S. Scott (IFIP Congress, 1983)

Semantically Based Programming Tools (Summary). - William L. Scherlis; Dana S. Scott (TAPSOFT, Vol.1, 1985)

Capturing Concepts with Data Structures. - Dana S. Scott (DS-2, 1986)

Domains and Logics (Extended Abstract) - Dana S. Scott (LICS, 1989)

Semantic Domains. - Carl A. Gunter; Dana S. Scott (Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990)

Will Logicians be Replaced by Machines? - Dana S. Scott (TACS, 1991)

Extensional PERs - Peter J. Freyd; P. Mulry; Giuseppe Rosolini; Dana S. Scott (Inf. Comput., 1992)

First Steps Towards Inferential Programming. - William L. Scherlis; Dana S. Scott (Program Verification, 1993)

A Type-Theoretical Alternative to ISWIM, CUCH, OWHY. - Dana S. Scott (Theor. Comput. Sci., 1993)

A. Nico Habermann 1932-1993. - Dana S. Scott (Acta Informatica, 1994)

Symbolic Computation and Teaching. - Dana S. Scott (AISMC, 1996)

What Can We Hope to Achieve From Automated Deduction? (Abstract). - Dana S. Scott (CADE, 1996)

Type Theory via Exact Categories. - Lars Birkedal; Aurelio Carboni; Giuseppe Rosolini; Dana S. Scott (LICS, 1998)

Effective versions of equilogical spaces. - Dana S. Scott (Workshop on Domains, 1998)

Local Realizability Toposes and a Modal Logic for Computability. - Steven Awodey; Lars Birkedal; Dana S. Scott (Realizability Semantics and Applications@FLoC, 1999)

Preface. - Lars Birkedal; Jaap van Oosten; Giuseppe Rosolini; Dana S. Scott (Realizability Semantics and Applications@FLoC, 1999)

Powersets, Fixed Points, and Lambda Calculus. - Dana S. Scott (MFCSIT, 2000)

Some Reflections on Strachey and His Work. - Dana S. Scott (High. Order Symb. Comput., 2000)

A New Category for Semantics. - Dana S. Scott (MFCS, 2001)

Equilogical spaces. - Andrej Bauer; Lars Birkedal; Dana S. Scott (Theor. Comput. Sci., 2004)

Continuous Lattices and Domains. - Ulrich Berger 001; Gerhard Gierz; Karl Heinrich Hofmann; Klaus Keimel; Jimmie D. Lawson; Michael W. Mislove; Dana S. Scott (Stud Logica, 2007)

Reconsidering Ordered Pairs. - Dana S. Scott; Dominic McCarty (Bull. Symb. Log., 2008)

Semilattices, Domains, and Computability (Invited Talk). - Dana S. Scott (CCA, 2009)

Lambda Calculus Then and Now. - Dana S. Scott (ACM-TURING, 2012)

Dedication. - Stephen Brookes; Benjamin C. Pierce; Gordon D. Plotkin; Dana S. Scott (MFPS, 2013)

Stochastic λ-calculi: An extended abstract. - Dana S. Scott (J. Appl. Log., 2014)

Cartesian closed categories of separable Scott domains. - Andrej Bauer; Gordon D. Plotkin; Dana S. Scott (Theor. Comput. Sci., 2014)

Automating Free Logic in Isabelle/HOL. - Christoph Benzmüller; Dana S. Scott (ICMS, 2016)

Axiomatizing Category Theory in Free Logic. - Christoph Benzmüller; Dana S. Scott (CoRR, 2016)

Boolean-Valued Semantics for the Stochastic λ-Calculus. - Giorgio Bacci; Robert Furber; Dexter Kozen; Radu Mardare; Prakash Panangaden; Dana S. Scott (LICS, 2018)

Axiom Systems for Category Theory in Free Logic. - Christoph Benzmüller; Dana S. Scott (Arch. Formal Proofs, 2018)

Can Modalities Save Naive Set Theory? - Peter Fritz; Harvey Lederman; Tiankai Liu; Dana S. Scott (Rev. Symb. Log., 2018)

A Calculus of Regions Respecting Both Measure and Topology. - Tamar Lando; Dana S. Scott (J. Philos. Log., 2019)

Computer-Supported Exploration of a Categorical Axiomatization of Modeloids. - Lucca Tiemens; Dana S. Scott; Christoph Benzmüller; Miroslav Benda (RAMiCS, 2020)

Automating Free Logic in HOL, with an Experimental Application in Category Theory. - Christoph Benzmüller; Dana S. Scott (J. Autom. Reason., 2020)

Interpreting Lambda Calculus in Domain-Valued Random Variables. - Robert Furber; Radu Mardare; Prakash Panangaden; Dana S. Scott (CoRR, 2021)

Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation. - Jonas Bayer; Alexey Gonus; Christoph Benzmüller; Dana S. Scott (CICM, 2023)

Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation. - Jonas Bayer; Aleksey Gonus; Christoph Benzmüller; Dana S. Scott (CoRR, 2023)

Notes on Gödel's and Scott's Variants of the Ontological Argument (Isabelle/HOL dataset). - Christoph Benzmüller; Dana S. Scott (Arch. Formal Proofs, 2025)