| 2004 |
|---|
| 31 | EE | Andrej Bauer,
Lars Birkedal,
Dana S. Scott:
Equilogical spaces.
Theor. Comput. Sci. 315(1): 35-59 (2004) |
| 2002 |
|---|
| 30 | | Steven Awodey,
Lars Birkedal,
Dana S. Scott:
Local Realizability Toposes and a Modal Logic for Computability.
Mathematical Structures in Computer Science 12(3): 319-334 (2002) |
| 2001 |
|---|
| 29 | EE | Dana S. Scott:
A New Category for Semantics.
MFCS 2001: 1-2 |
| 2000 |
|---|
| 28 | EE | Dana S. Scott:
Effective versions of equilogical spaces.
Electr. Notes Theor. Comput. Sci. 35: (2000) |
| 27 | EE | Dana S. Scott:
Powersets, Fixed Points, and Lambda Calculus.
Electr. Notes Theor. Comput. Sci. 40: (2000) |
| 26 | | Dana S. Scott:
Some Reflections on Strachey and His Work.
Higher-Order and Symbolic Computation 13(1/2): 103-114 (2000) |
| 1999 |
|---|
| 25 | EE | Steven Awodey,
Lars Birkedal,
Dana S. Scott:
Local Realizability Toposes and a Modal Logic for Computability.
Electr. Notes Theor. Comput. Sci. 23(1): (1999) |
| 24 | EE | Lars Birkedal,
Jaap van Oosten,
Giuseppe Rosolini,
Dana S. Scott:
Preface.
Electr. Notes Theor. Comput. Sci. 23(1): (1999) |
| 1998 |
|---|
| 23 | | Lars Birkedal,
Aurelio Carboni,
Giuseppe Rosolini,
Dana S. Scott:
Type Theory via Exact Categories.
LICS 1998: 188-198 |
| 1996 |
|---|
| 22 | | Dana S. Scott:
Symbolic Computation and Teaching.
AISMC 1996: 1-20 |
| 21 | | Dana S. Scott:
What Can We Hope to Achieve From Automated Deduction? (Abstract).
CADE 1996: 245 |
| 1994 |
|---|
| 20 | | Dana S. Scott:
A. Nico Habermann 1932-1993.
Acta Inf. 31(1): 1-3 (1994) |
| 1993 |
|---|
| 19 | | Dana S. Scott:
A Type-Theoretical Alternative to ISWIM, CUCH, OWHY.
Theor. Comput. Sci. 121(1&2): 411-440 (1993) |
| 1992 |
|---|
| 18 | | Peter J. Freyd,
P. Mulry,
Giuseppe Rosolini,
Dana S. Scott:
Extensional PERs
Inf. Comput. 98(2): 211-227 (1992) |
| 1991 |
|---|
| 17 | | Dana S. Scott:
Will Logicians be Replaced by Machines?
TACS 1991: 771 |
| 1990 |
|---|
| 16 | | Peter J. Freyd,
P. Mulry,
Giuseppe Rosolini,
Dana S. Scott:
Extensional PERs
LICS 1990: 346-354 |
| 15 | | Carl A. Gunter,
Dana S. Scott:
Semantic Domains.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 633-674 |
| 1989 |
|---|
| 14 | | Dana S. Scott:
Domains and Logics (Extended Abstract)
LICS 1989: 4-5 |
| 1986 |
|---|
| 13 | | Dana S. Scott:
Capturing Concepts with Data Structures.
DS-2 1986: 341-354 |
| 1985 |
|---|
| 12 | | William L. Scherlis,
Dana S. Scott:
Semantically Based Programming Tools (Summary).
TAPSOFT, Vol.1 1985: 52-59 |
| 1983 |
|---|
| 11 | | William L. Scherlis,
Dana S. Scott:
First Steps Towards Inferential Programming.
IFIP Congress 1983: 199-212 |
| 1982 |
|---|
| 10 | | Dana S. Scott:
Domains for Denotational Semantics.
ICALP 1982: 577-613 |
| 1977 |
|---|
| 9 | | Dana S. Scott:
Logic and Programming Languages.
Commun. ACM 20(9): 634-641 (1977) |
| 8 | | 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 |
|---|
| 7 | | Dana S. Scott:
Data Types as Lattices.
SIAM J. Comput. 5(3): 522-587 (1976) |
| 1975 |
|---|
| 6 | | Dana S. Scott:
Combinators and classes.
Lambda-Calculus and Computer Science Theory 1975: 1-26 |
| 5 | | Dana S. Scott:
Some philosophical issues concerning theories of combinators.
Lambda-Calculus and Computer Science Theory 1975: 346-366 |
| 1967 |
|---|
| 4 | | Dana S. Scott:
Some Definitional Suggestions for Automata Theory.
J. Comput. Syst. Sci. 1(2): 187-212 (1967) |
| 3 | | Dana S. Scott:
A Proof of the Independence of the Continuum Hypothesis.
Mathematical Systems Theory 1(2): 89-111 (1967) |
| 1958 |
|---|
| 2 | | Dana S. Scott,
Patrick Suppes:
Foundational Aspects of Theories of Measurement.
J. Symb. Log. 23(2): 113-128 (1958) |
| 1 | | 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) |
