Dana S. Scott

Publication Activity (10 Years)

Years Active: 1958-2023
Publications (10 Years): 12

Top Topics

Valued Semantics

Computer Supported Collaboration

Top Venues

Publications

Jonas Bayer, Alexey Gonus, Christoph Benzmüller, Dana S. Scott
Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation. CICM (2023)
Jonas Bayer, Aleksey Gonus, Christoph Benzmüller, Dana S. Scott
Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation. CoRR (2023)
Robert Furber, Radu Mardare, Prakash Panangaden, Dana S. Scott
Interpreting Lambda Calculus in Domain-Valued Random Variables. CoRR (2021)
Christoph Benzmüller, Dana S. Scott
Automating Free Logic in HOL, with an Experimental Application in Category Theory. J. Autom. Reason. 64 (1) (2020)
Lucca Tiemens, Dana S. Scott, Christoph Benzmüller, Miroslav Benda
Computer-Supported Exploration of a Categorical Axiomatization of Modeloids. RAMiCS (2020)
Tamar Lando, Dana S. Scott
A Calculus of Regions Respecting Both Measure and Topology. J. Philos. Log. 48 (5) (2019)
Lucca Tiemens, Dana S. Scott, Christoph Benzmüller, Miroslav Benda
Computer-supported Exploration of a Categorical Axiomatization of Modeloids. CoRR (2019)
Christoph Benzmüller, Dana S. Scott
Axiom Systems for Category Theory in Free Logic. Arch. Formal Proofs 2018 (2018)
Peter Fritz, Harvey Lederman, Tiankai Liu, Dana S. Scott
Can Modalities Save Naive Set Theory? Rev. Symb. Log. 11 (1) (2018)
Giorgio Bacci, Robert Furber, Dexter Kozen, Radu Mardare, Prakash Panangaden, Dana S. Scott
Boolean-Valued Semantics for the Stochastic λ-Calculus. LICS (2018)
Christoph Benzmüller, Dana S. Scott
Automating Free Logic in Isabelle/HOL. ICMS (2016)
Christoph Benzmüller, Dana S. Scott
Axiomatizing Category Theory in Free Logic. CoRR (2016)
Dana S. Scott
Stochastic λ-calculi: An extended abstract. J. Appl. Log. 12 (3) (2014)
Andrej Bauer, Gordon D. Plotkin, Dana S. Scott
Cartesian closed categories of separable Scott domains. Theor. Comput. Sci. 546 (2014)
Stephen Brookes, Benjamin C. Pierce, Gordon D. Plotkin, Dana S. Scott
Dedication. MFPS (2013)
Dana S. Scott
Lambda Calculus Then and Now. ACM-TURING (2012)
Dana S. Scott
Semilattices, Domains, and Computability (Invited Talk). CCA (2009)
Dana S. Scott, Dominic McCarty
Reconsidering Ordered Pairs. Bull. Symb. Log. 14 (3) (2008)
Ulrich Berger, Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove, Dana S. Scott
Continuous Lattices and Domains. Stud Logica 86 (1) (2007)
Andrej Bauer, Lars Birkedal, Dana S. Scott
Equilogical spaces. Theor. Comput. Sci. 315 (1) (2004)
Steven Awodey, Lars Birkedal, Dana S. Scott
Local Realizability Toposes and a Modal Logic for Computability. Math. Struct. Comput. Sci. 12 (3) (2002)
Dana S. Scott
A New Category for Semantics. MFCS (2001)
Dana S. Scott
Effective versions of equilogical spaces. Electron. Notes Theor. Comput. Sci. 35 (2000)
Dana S. Scott
Some Reflections on Strachey and His Work. High. Order Symb. Comput. 13 (1/2) (2000)
Dana S. Scott
Powersets, Fixed Points, and Lambda Calculus. Electron. Notes Theor. Comput. Sci. 40 (2000)
Lars Birkedal, Jaap van Oosten, Giuseppe Rosolini, Dana S. Scott
Preface. Electron. Notes Theor. Comput. Sci. 23 (1) (1999)
Steven Awodey, Lars Birkedal, Dana S. Scott
Local Realizability Toposes and a Modal Logic for Computability. Electron. Notes Theor. Comput. Sci. 23 (1) (1999)
Lars Birkedal, Aurelio Carboni, Giuseppe Rosolini, Dana S. Scott
Type Theory via Exact Categories. LICS (1998)
Dana S. Scott
What Can We Hope to Achieve From Automated Deduction? (Abstract). CADE (1996)
Dana S. Scott
Symbolic Computation and Teaching. AISMC (1996)
Dana S. Scott
A. Nico Habermann 1932-1993. Acta Informatica 31 (1) (1994)
Dana S. Scott
A Type-Theoretical Alternative to ISWIM, CUCH, OWHY. Theor. Comput. Sci. 121 (1&2) (1993)
Peter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana S. Scott
Extensional PERs Inf. Comput. 98 (2) (1992)
Dana S. Scott
Will Logicians be Replaced by Machines? TACS (1991)
Peter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana S. Scott
Extensional PERs LICS (1990)
Dana S. Scott
Domains and Logics (Extended Abstract) LICS (1989)
Dana S. Scott
Capturing Concepts with Data Structures. DS-2 (1986)
William L. Scherlis, Dana S. Scott
Semantically Based Programming Tools (Summary). TAPSOFT, Vol.1 (1985)
William L. Scherlis, Dana S. Scott
First Steps Towards Inferential Programming. IFIP Congress (1983)
Dana S. Scott
Domains for Denotational Semantics. ICALP (1982)
Dana S. Scott
Logic and Programming Languages. Commun. ACM 20 (9) (1977)
Robin O. Gandy, Dana S. Scott
European Meeting of the Association for Symbolic Logic: Oxford, England, 1976. J. Symb. Log. 42 (3) (1977)
Dana S. Scott
Data Types as Lattices. SIAM J. Comput. 5 (3) (1976)
Dana S. Scott
Some philosophical issues concerning theories of combinators. Lambda-Calculus and Computer Science Theory (1975)
Dana S. Scott
Combinators and classes. Lambda-Calculus and Computer Science Theory (1975)
Dana S. Scott
Mathematical concepts in programming language semantics. AFIPS Spring Joint Computing Conference (1972)
Dana S. Scott
A Proof of the Independence of the Continuum Hypothesis. Math. Syst. Theory 1 (2) (1967)
Dana S. Scott
Some Definitional Suggestions for Automata Theory. J. Comput. Syst. Sci. 1 (2) (1967)
Michael O. Rabin, Dana S. Scott
Finite Automata and Their Decision Problems. IBM J. Res. Dev. 3 (2) (1959)
Dana S. Scott, Patrick Suppes
Foundational Aspects of Theories of Measurement. J. Symb. Log. 23 (2) (1958)
I. L. Gal, J. Barkley Rosser, Dana S. Scott
Generalization of a Lemma of G. F. Rose. J. Symb. Log. 23 (2) (1958)