Logic of Domains

I SFP Domains.- 1 Introduction.- 2 Prerequisites.- 3 A Representation of SFP.- 4 A Logic of SFP.- 5 A Mu-Calculus.- II Stable Domains.- 6 Categories.- 7 A Representation of DI.- 8 Stable Neighborhoods.- 9 Disjunctive Logics.- 10 Research Topics.

[1]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[2]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[3]  Christopher Strachey,et al.  Toward a mathematical semantics for computer languages , 1971 .

[4]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[5]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[6]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[7]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[8]  Jon Barwise,et al.  An Introduction to First-Order Logic , 1977 .

[9]  Stephen A. Cook,et al.  Soundness and Completeness of an Axiom System for Program Verification , 1978, SIAM J. Comput..

[10]  P. T. Johnstone,et al.  A syntactic approach to Diers' localizable categories , 1979 .

[11]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[12]  Michael J. C. Gordon,et al.  The Denotational Description of Programming Languages , 1979, Springer New York.

[13]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[14]  J. W. de Bakker,et al.  Mathematical theory of program correctness , 1980, Prentice-Hall international series in computer science.

[15]  Dana S. Scott,et al.  Lectures on a Mathematical Theory of Computation , 1982 .

[16]  D. Scott.  Domains for Denotational Semantics , 1982, ICALP.

[17]  D. Kozen.  Results on the Propositional µ-Calculus , 1982 .

[18]  M. Smyth.  Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.

[19]  Michael B. Smyth,et al.  The Largest Cartesian Closed Category of Domains , 1983, Theor. Comput. Sci..

[20]  Krzysztof Apt.  Ten years of Hoare s logic, part II: nondeterminism , 1983 .

[21]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[22]  Glynn Winskel,et al.  Using Information Systems to Solve Recursive Domain Equations Effectively , 1984, Semantics of Data Types.

[23]  Stephen D. Brookes,et al.  An Axiomatic Treatment of a Parallel Programming Language , 1985, Logic of Programs.

[24]  Carl A. Gunter.  Profinite Solutions For Recursive Domain Equations , 1985 .

[25]  Alley Stoughton,et al.  Fully abstract models of programming languages , 1986, Research Notes in Theoretical Computer Science.

[26]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[27]  Edmund Robinson,et al.  Power-domains, modalities and the Vietoris monad , 1986 .

[28]  Edmund Robinson,et al.  Logical Aspects of Denotational Semantics , 1987, Category Theory and Computer Science.

[29]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[30]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[31]  Carl A. Gunter.  Universal Profinite Domains , 1987, Inf. Comput..

[32]  Albert R. Meyer,et al.  Semantical paradigms: notes for an invited lecture , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[33]  Glynn Winskel,et al.  Domain Theoretic Models of Polymorphism , 1989, Inf. Comput..

[34]  Wesley Phoa,et al.  Effective domains and intrinsic structure , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[35]  Kim G. Larsen,et al.  Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion , 1990, Theor. Comput. Sci..

[36]  Manfred Droste,et al.  Universal domains in the theory of denotational semantics of programming languages , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[37]  Paul Taylor.  An algebraic approach to stable domains , 1990 .

[38]  Manfred Droste,et al.  Non-Deterministic Information Systems and their Domains , 1990, Theor. Comput. Sci..

[39]  Guo-Qiang Zhang.  A Monoidal Closed Category of Event Structures , 1991, MFPS.

[40]  Thomas Ehrhard,et al.  Stone Duality for Stable Functions , 1991, Category Theory and Computer Science.

[41]  Pierre-Louis Curien.  Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.