Non-Deterministic Information Systems and their Domains
暂无分享,去创建一个
[1] Guo-Qiang Zhang. Logic of Domains , 1991, Progress in Theoretical Computer Science.
[2] Achim Jung. Cartesian Closed Categories of Algebraic CPOs , 1990, Theor. Comput. Sci..
[3] Manfred Droste. Event Structures and Domains , 1989, Theor. Comput. Sci..
[4] Manfred Droste,et al. Recursive Domain Equations for Concrete Data Structures , 1989, Inf. Comput..
[5] Glynn Winskel,et al. Event Structures , 1986, Advances in Petri Nets.
[6] Glynn Winskel,et al. Using Information Systems to Solve Recursive Domain Equations Effectively , 1984, Semantics of Data Types.
[7] Hilary A. Priestley,et al. Ordered Sets and Duality for Distributive Lattices , 1984 .
[8] Michael B. Smyth,et al. The Largest Cartesian Closed Category of Domains , 1983, Theor. Comput. Sci..
[9] D. Scott. Domains for Denotational Semantics , 1982, ICALP.
[10] Pierre-Louis Curien,et al. Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..
[11] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .
[12] J. D. Lawson,et al. Generalized continuous and hypercontinuous lattices , 1981 .
[13] M. Erné. Separation axioms for interval topologies , 1980 .
[14] Mitchell Wand. Fixed-Point Constructions in Order-Enriched Categories , 1979, Theor. Comput. Sci..
[15] Gordon D. Plotkin,et al. The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract) , 1977, FOCS.
[16] Daniel J. Lehmann,et al. Data types , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[17] Gordon D. Plotkin,et al. A Powerdomain Construction , 1976, SIAM J. Comput..
[18] W. Lewis,et al. The Ordering of Spec R , 1976, Canadian Journal of Mathematics.
[19] R. Balbes. On the Partially Ordered Set of Prime Ideals of a Distributive Lattice , 1971, Canadian Journal of Mathematics.
[20] E. S. Wolk. Order-compatible topologies on a partially ordered set , 1958 .