Search the dblp DataBase
Dana S. Scott :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Dana S. Scott Domains for Denotational Semantics. [Citation Graph (4, 0)][DBLP ] ICALP, 1982, pp:577-613 [Conf ] William L. Scherlis , Dana S. Scott First Steps Towards Inferential Programming. [Citation Graph (1, 0)][DBLP ] IFIP Congress, 1983, pp:199-212 [Conf ] Dana S. Scott Symbolic Computation and Teaching. [Citation Graph (0, 0)][DBLP ] AISMC, 1996, pp:1-20 [Conf ] Dana S. Scott What Can We Hope to Achieve From Automated Deduction? (Abstract). [Citation Graph (0, 0)][DBLP ] CADE, 1996, pp:245- [Conf ] Dana S. Scott Capturing Concepts with Data Structures. [Citation Graph (0, 0)][DBLP ] DS-2, 1986, pp:341-354 [Conf ] Dana S. Scott Combinators and classes. [Citation Graph (0, 0)][DBLP ] Lambda-Calculus and Computer Science Theory, 1975, pp:1-26 [Conf ] Dana S. Scott Some philosophical issues concerning theories of combinators. [Citation Graph (0, 0)][DBLP ] Lambda-Calculus and Computer Science Theory, 1975, pp:346-366 [Conf ] Lars Birkedal , Aurelio Carboni , Giuseppe Rosolini , Dana S. Scott Type Theory via Exact Categories. [Citation Graph (0, 0)][DBLP ] LICS, 1998, pp:188-198 [Conf ] Peter J. Freyd , P. Mulry , Giuseppe Rosolini , Dana S. Scott Extensional PERs [Citation Graph (0, 0)][DBLP ] LICS, 1990, pp:346-354 [Conf ] Dana S. Scott Domains and Logics (Extended Abstract) [Citation Graph (0, 0)][DBLP ] LICS, 1989, pp:4-5 [Conf ] Dana S. Scott A New Category for Semantics. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:1-2 [Conf ] Dana S. Scott Will Logicians be Replaced by Machines? [Citation Graph (0, 0)][DBLP ] TACS, 1991, pp:771- [Conf ] William L. Scherlis , Dana S. Scott Semantically Based Programming Tools (Summary). [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1985, pp:52-59 [Conf ] Dana S. Scott A. Nico Habermann 1932-1993. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1994, v:31, n:1, pp:1-3 [Journal ] Dana S. Scott Logic and Programming Languages. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1977, v:20, n:9, pp:634-641 [Journal ] Steven Awodey , Lars Birkedal , Dana S. Scott Local Realizability Toposes and a Modal Logic for Computability. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:23, n:1, pp:- [Journal ] Lars Birkedal , Jaap van Oosten , Giuseppe Rosolini , Dana S. Scott Preface. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:23, n:1, pp:- [Journal ] Dana S. Scott Powersets, Fixed Points, and Lambda Calculus. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2000, v:40, n:, pp:- [Journal ] Dana S. Scott Effective versions of equilogical spaces. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2000, v:35, n:, pp:- [Journal ] Peter J. Freyd , P. Mulry , Giuseppe Rosolini , Dana S. Scott Extensional PERs [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1992, v:98, n:2, pp:211-227 [Journal ] Dana S. Scott Some Definitional Suggestions for Automata Theory. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1967, v:1, n:2, pp:187-212 [Journal ] I. L. Gal , J. Barkley Rosser , Dana S. Scott Generalization of a Lemma of G. F. Rose. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1958, v:23, n:2, pp:137-138 [Journal ] Robin O. Gandy , Dana S. Scott European Meeting of the Association for Symbolic Logic: Oxford, England, 1976. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1977, v:42, n:3, pp:437-479 [Journal ] Dana S. Scott , Patrick Suppes Foundational Aspects of Theories of Measurement. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1958, v:23, n:2, pp:113-128 [Journal ] Dana S. Scott Some Reflections on Strachey and His Work. [Citation Graph (0, 0)][DBLP ] Higher-Order and Symbolic Computation, 2000, v:13, n:1/2, pp:103-114 [Journal ] Steven Awodey , Lars Birkedal , Dana S. Scott Local Realizability Toposes and a Modal Logic for Computability. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 2002, v:12, n:3, pp:319-334 [Journal ] Dana S. Scott A Proof of the Independence of the Continuum Hypothesis. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1967, v:1, n:2, pp:89-111 [Journal ] Dana S. Scott Data Types as Lattices. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1976, v:5, n:3, pp:522-587 [Journal ] Andrej Bauer , Lars Birkedal , Dana S. Scott Equilogical spaces. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:315, n:1, pp:35-59 [Journal ] Dana S. Scott A Type-Theoretical Alternative to ISWIM, CUCH, OWHY. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1993, v:121, n:1&2, pp:411-440 [Journal ] Semilattices, Domains, and Computability (Invited Talk). [Citation Graph (, )][DBLP ] Reconsidering Ordered Pairs. [Citation Graph (, )][DBLP ] Search in 0.046secs, Finished in 0.049secs