Dana S. Scott - RankMe

57 papers A* 5A 1B 3C 3Journal 27Unranked 14

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