default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDana S. Scott
Person information
- award: Turing Award, 1976
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c25]Jonas Bayer, Alexey Gonus, Christoph Benzmüller, Dana S. Scott:
Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation. CICM 2023: 69-83- [i4]Jonas Bayer, Aleksey Gonus, Christoph Benzmüller
, Dana S. Scott:
Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation. CoRR abs/2306.09074 (2023) - 2021
- [i3]Robert Furber, Radu Mardare, Prakash Panangaden, Dana S. Scott:
Interpreting Lambda Calculus in Domain-Valued Random Variables. CoRR abs/2112.06339 (2021) - 2020
- [j22]Christoph Benzmüller, Dana S. Scott:
Automating Free Logic in HOL, with an Experimental Application in Category Theory. J. Autom. Reason. 64(1): 53-72 (2020) - [c24]Lucca Tiemens, Dana S. Scott, Christoph Benzmüller, Miroslav Benda:
Computer-Supported Exploration of a Categorical Axiomatization of Modeloids. RAMiCS 2020: 302-317
2010 – 2019
- 2019
- [j21]Tamar Lando, Dana S. Scott:
A Calculus of Regions Respecting Both Measure and Topology. J. Philos. Log. 48(5): 825-850 (2019) - [i2]Lucca Tiemens, Dana S. Scott, Christoph Benzmüller, Miroslav Benda:
Computer-supported Exploration of a Categorical Axiomatization of Modeloids. CoRR abs/1910.12863 (2019) - 2018
- [j20]Christoph Benzmüller, Dana S. Scott:
Axiom Systems for Category Theory in Free Logic. Arch. Formal Proofs 2018 (2018) - [j19]Peter Fritz, Harvey Lederman, Tiankai Liu, Dana S. Scott:
Can Modalities Save Naive Set Theory? Rev. Symb. Log. 11(1): 21-47 (2018) - [c23]Giorgio Bacci, Robert Furber, Dexter Kozen, Radu Mardare, Prakash Panangaden, Dana S. Scott:
Boolean-Valued Semantics for the Stochastic λ-Calculus. LICS 2018: 669-678 - 2016
- [c22]Christoph Benzmüller, Dana S. Scott:
Automating Free Logic in Isabelle/HOL. ICMS 2016: 43-50 - [i1]Christoph Benzmüller, Dana S. Scott:
Axiomatizing Category Theory in Free Logic. CoRR abs/1609.01493 (2016) - 2014
- [j18]Dana S. Scott:
Stochastic λ-calculi: An extended abstract. J. Appl. Log. 12(3): 369-376 (2014) - [j17]Andrej Bauer, Gordon D. Plotkin, Dana S. Scott:
Cartesian closed categories of separable Scott domains. Theor. Comput. Sci. 546: 17-29 (2014) - 2013
- [c21]Stephen Brookes, Benjamin C. Pierce, Gordon D. Plotkin, Dana S. Scott:
Dedication. MFPS 2013: 3-5 - 2012
- [c20]Dana S. Scott:
Lambda Calculus Then and Now. ACM-TURING 2012: 9:1
2000 – 2009
- 2009
- [c19]Dana S. Scott:
Semilattices, Domains, and Computability (Invited Talk). CCA 2009 - 2008
- [j16]Dana S. Scott, Dominic McCarty:
Reconsidering Ordered Pairs. Bull. Symb. Log. 14(3): 379-397 (2008) - 2007
- [j15]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): 137-138 (2007) - 2004
- [j14]Andrej Bauer, Lars Birkedal, Dana S. Scott:
Equilogical spaces. Theor. Comput. Sci. 315(1): 35-59 (2004) - 2002
- [j13]Steven Awodey, Lars Birkedal, Dana S. Scott:
Local Realizability Toposes and a Modal Logic for Computability. Math. Struct. Comput. Sci. 12(3): 319-334 (2002) - 2001
- [c18]Dana S. Scott:
A New Category for Semantics. MFCS 2001: 1-2 - 2000
- [j12]Dana S. Scott:
Some Reflections on Strachey and His Work. High. Order Symb. Comput. 13(1/2): 103-114 (2000) - [c17]Dana S. Scott:
Powersets, Fixed Points, and Lambda Calculus. MFCSIT 2000: 392
1990 – 1999
- 1999
- [c16]Steven Awodey, Lars Birkedal, Dana S. Scott:
Local Realizability Toposes and a Modal Logic for Computability. Realizability Semantics and Applications@FLoC 1999: 13-26 - [c15]Lars Birkedal, Jaap van Oosten, Giuseppe Rosolini, Dana S. Scott:
Preface. Realizability Semantics and Applications@FLoC 1999: 189-190 - [e1]Lars Birkedal, Jaap van Oosten, Giuseppe Rosolini, Dana S. Scott:
Tutorial Workshop on Realizability Semantics and Applications, associated to FLoC'99, the 1999 Federated Logic Conference, Trento, Italy, June 30 - July 1, 1999. Electronic Notes in Theoretical Computer Science 23(1), Elsevier 1999 [contents] - 1998
- [c14]Lars Birkedal, Aurelio Carboni, Giuseppe Rosolini, Dana S. Scott:
Type Theory via Exact Categories. LICS 1998: 188-198 - [c13]Dana S. Scott:
Effective versions of equilogical spaces. Workshop on Domains 1998: 204 - 1996
- [c12]Dana S. Scott:
Symbolic Computation and Teaching. AISMC 1996: 1-20 - [c11]Dana S. Scott:
What Can We Hope to Achieve From Automated Deduction? (Abstract). CADE 1996: 245 - 1994
- [j11]Dana S. Scott:
A. Nico Habermann 1932-1993. Acta Informatica 31(1): 1-3 (1994) - 1993
- [j10]Dana S. Scott:
A Type-Theoretical Alternative to ISWIM, CUCH, OWHY. Theor. Comput. Sci. 121(1&2): 411-440 (1993) - 1992
- [j9]Peter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana S. Scott:
Extensional PERs. Inf. Comput. 98(2): 211-227 (1992) - 1991
- [c10]Dana S. Scott:
Will Logicians be Replaced by Machines? TACS 1991: 771 - 1990
- [c9]Peter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana S. Scott:
Extensional PERs. LICS 1990: 346-354 - [p2]Carl A. Gunter, Dana S. Scott:
Semantic Domains. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 633-674
1980 – 1989
- 1989
- [c8]Dana S. Scott:
Domains and Logics (Extended Abstract). LICS 1989: 4-5 - 1986
- [c7]Dana S. Scott:
Capturing Concepts with Data Structures. DS-2 1986: 341-354 - 1985
- [c6]William L. Scherlis, Dana S. Scott:
Semantically Based Programming Tools (Summary). TAPSOFT, Vol.1 1985: 52-59 - 1983
- [c5]William L. Scherlis, Dana S. Scott:
First Steps Towards Inferential Programming. IFIP Congress 1983: 199-212 - 1982
- [c4]Dana S. Scott:
Domains for Denotational Semantics. ICALP 1982: 577-613
1970 – 1979
- 1977
- [j8]Dana S. Scott:
Logic and Programming Languages. Commun. ACM 20(9): 634-641 (1977) - [j7]Robin O. Gandy, Dana S. Scott:
European Meeting of the Association for Symbolic Logic: Oxford, England, 1976. J. Symb. Log. 42(3): 437-479 (1977) - 1976
- [j6]Dana S. Scott:
Data Types as Lattices. SIAM J. Comput. 5(3): 522-587 (1976) - 1975
- [c3]Dana S. Scott:
Combinators and classes. Lambda-Calculus and Computer Science Theory 1975: 1-26 - [c2]Dana S. Scott:
Some philosophical issues concerning theories of combinators. Lambda-Calculus and Computer Science Theory 1975: 346-366 - 1972
- [c1]Dana S. Scott:
Mathematical concepts in programming language semantics. AFIPS Spring Joint Computing Conference 1972: 225-234 - 1971
- [p1]Dana S. Scott:
The lattice of flow diagrams. Symposium on Semantics of Algorithmic Languages 1971: 311-366
1960 – 1969
- 1967
- [j5]Dana S. Scott:
Some Definitional Suggestions for Automata Theory. J. Comput. Syst. Sci. 1(2): 187-212 (1967) - [j4]Dana S. Scott:
A Proof of the Independence of the Continuum Hypothesis. Math. Syst. Theory 1(2): 89-111 (1967)
1950 – 1959
- 1959
- [j3]Michael O. Rabin, Dana S. Scott:
Finite Automata and Their Decision Problems. IBM J. Res. Dev. 3(2): 114-125 (1959) - 1958
- [j2]Dana S. Scott, Patrick Suppes:
Foundational Aspects of Theories of Measurement. J. Symb. Log. 23(2): 113-128 (1958) - [j1]I. L. Gal, J. Barkley Rosser, Dana S. Scott:
Generalization of a Lemma of G. F. Rose. J. Symb. Log. 23(2): 137-138 (1958)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
