Dana S. Scott

According to our database1, Dana S. Scott
  • authored at least 42 papers between 1958 and 2016.
  • has a "Dijkstra number"2 of four.

Awards

Turing Prize recipient

Turing Prize 1976, "For their joint paper "Finite Automata and Their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field" awarded to Dana S. Scott and Michael O. Rabin.

ACM Fellow

ACM Fellow 1994, "For their joint paper 'Finite Automataand Their Decision Problem,' which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
Axiomatizing Category Theory in Free Logic.
CoRR, 2016

Automating Free Logic in Isabelle/HOL.
Proceedings of the Mathematical Software - ICMS 2016, 2016

2014
Cartesian closed categories of separable Scott domains.
Theor. Comput. Sci., 2014

Stochastic λ-calculi: An extended abstract.
J. Applied Logic, 2014

2013
Dedication.
Electr. Notes Theor. Comput. Sci., 2013

2012
Lambda Calculus Then and Now.
Proceedings of the ACM Turing Centenary Celebration, 2012

2009
Semilattices, Domains, and Computability (Invited Talk).
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008
Reconsidering Ordered Pairs.
Bulletin of Symbolic Logic, 2008

2004
Equilogical spaces.
Theor. Comput. Sci., 2004

2002
Local Realizability Toposes and a Modal Logic for Computability.
Mathematical Structures in Computer Science, 2002

2001
A New Category for Semantics.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000
Some Reflections on Strachey and His Work.
Higher-Order and Symbolic Computation, 2000

Effective versions of equilogical spaces.
Electr. Notes Theor. Comput. Sci., 2000

Powersets, Fixed Points, and Lambda Calculus.
Electr. Notes Theor. Comput. Sci., 2000

1999
Preface.
Electr. Notes Theor. Comput. Sci., 1999

Local Realizability Toposes and a Modal Logic for Computability.
Electr. Notes Theor. Comput. Sci., 1999

1998
Type Theory via Exact Categories.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1996
What Can We Hope to Achieve From Automated Deduction? (Abstract).
Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

Symbolic Computation and Teaching.
Proceedings of the Artificial Intelligence and Symbolic Mathematical Computation, 1996

1994
A. Nico Habermann 1932-1993.
Acta Inf., 1994

1993
A Type-Theoretical Alternative to ISWIM, CUCH, OWHY.
Theor. Comput. Sci., 1993

1992
Extensional PERs
Inf. Comput., June, 1992

1991
Will Logicians be Replaced by Machines?
Proceedings of the Theoretical Aspects of Computer Software, 1991

1990
Extensional PERs
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

Semantic Domains.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990

1989
Domains and Logics (Extended Abstract)
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1986
Capturing Concepts with Data Structures.
Proceedings of the IFIP WG 2.6 Working Conference on Data Semantics, 1986

1985
Semantically Based Programming Tools (Summary).
Proceedings of the Mathematical Foundations of Software Development, 1985

1983
First Steps Towards Inferential Programming.
IFIP Congress, 1983

1982
Domains for Denotational Semantics.
Proceedings of the Automata, 1982

1977
European Meeting of the Association for Symbolic Logic: Oxford, England, 1976.
J. Symb. Log., 1977

Logic and Programming Languages.
Commun. ACM, 1977

1976
Data Types as Lattices.
SIAM J. Comput., 1976

1975
Some philosophical issues concerning theories of combinators.
Proceedings of the Lambda-Calculus and Computer Science Theory, 1975

Combinators and classes.
Proceedings of the Lambda-Calculus and Computer Science Theory, 1975

1972
Mathematical concepts in programming language semantics.
Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1972 Spring Joint Computer Conference, 1972

1971
The lattice of flow diagrams.
Proceedings of the Symposium on Semantics of Algorithmic Languages, 1971

1967
A Proof of the Independence of the Continuum Hypothesis.
Mathematical Systems Theory, 1967

Some Definitional Suggestions for Automata Theory.
J. Comput. Syst. Sci., 1967

1959
Finite Automata and Their Decision Problems.
IBM Journal of Research and Development, 1959

1958
Foundational Aspects of Theories of Measurement.
J. Symb. Log., 1958

Generalization of a Lemma of G. F. Rose.
J. Symb. Log., 1958


  Loading...