This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
§7 References
S. Abramsky, Domain Theory and the Logic of Observables Properties, PhD Thesis, QMC, University of London, 1987.
S. Abramsky, Domain Theory In Logical Form, submitted to Ann. Pure and Appl. Logic (1988).
G. Berry and P.L. Curien, Sequential algorithms on concrete data structures, Theoret. Comp. Sci. 20 (1982), 265–321.
M. Coppo, M. Dezani, G. Longo, Applicative information systems, Note Scientifiche S-83-5, Febbraio 1983.
A.L.S. Corner, R. Göbel, Prescribing endomorphism algebras — A unified treatment, Proceed. London Math. Soc. (3) 50 (1985) 447–479.
P.L. Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, Research Notes in Theoretical Computer Science, Pitman, London 1986.
M. Droste, Event structures and domains, Theoret. Comp. Sci. 68 (1989), 37–47.
M. Droste, Recursive domain equations for concrete data structures, Information and Computation 82 (1989), 65–80.
M. Droste, R. Göbel, Non-deterministic information systems and their domains, Theoret. Comp. Sci. 73 (1989), to appear.
E. Engeler, P. Läuchli, "Berechnungstheorie für Informatiker", Teubner Stuttgart 1988.
A. Kanda, D. Park, When are two effectively given domains identical? in: Springer LNCS 67 (1980) "Theor. Comp. Science, 4th GI Conference, Aachen 1979" (ed. K. Weihrauch) pp. 170–181.
K.G. Larsen and G. Winskel, Using information systems to solve recursive domain equations effectively, in: Semantics of Data Types, International Symposium Sophia-Antipolis 1984 (G. Kahn, D.B. MacQueen and G. Plotkin, eds.), Springer LNCS 173 (1984), pp. 109–129.
L.C. Paulson, Logic and Computation, Interactive Proof with Cambridge LCF, Cambridge UP, Cambridge Tracts in Theoretical Computer Science 1987.
D.S. Scott, Outline of a mathematical Theory of computation, Technical Monograph PRG-2 (1970), Oxford.
D.S. Scott, Continuous lattices, Proc. 1971 Dalhousie Conference on Toposes, Algebraic Geometry and Logic, Springer LNM 274 (1971), pp. 97–136.
D.S. Scott, Domains for denotational semantics, Proc. 9th International Coll. on Automata, Languages and Programming, Aarhus, Springer LNCS 140 (1982), pp. 577–613.
D.S. Scott, C. Strachey, Toward a Mathematical Semantics for Computer Languages, Proc. Sympos. Computer Sci., Symposia Series 21 (1971).
M.B. Smyth, The largest cartesian closed category of domains, Theor. Comp. Sci. 27 (1983) 109–119.
M.B. Smyth, Effectively given domains, Theoretical Computer Science 5 (1977) 257–274.
M.B. Smyth, G. Plotkin, The category—theoretic solution of recursive domain equations, Proc. 18th Symposium on Foundations of Computer Science. Providence, R.I., 1977.
D. Spreen, Computable one—to—one enumerations of effective domains, Springer LNCS 298 (1988) "Mathematical Foundation of Programming Language Semantics" (eds. M. Main, A. Melton, M. Mislove, D. Schmidt), pp. 372–384.
J. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Languages, MIT Press, Cambridge, Mass. 1977.
S. Vickers, "Topology via Logic", Cambridge Univ. Press (1989).
M. Wand, Fixed-point constructions in order-enriched categories, Research Report TR 23, Indiana University, 1975.
G. Winskel, Event structures, in: Springer LNCS 255 (1987) pp. 325–392.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Droste, M., Göbel, R. (1990). Effectively given information systems and domains. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '89. CSL 1989. Lecture Notes in Computer Science, vol 440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52753-2_36
Download citation
DOI: https://doi.org/10.1007/3-540-52753-2_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52753-4
Online ISBN: 978-3-540-47137-0
eBook Packages: Springer Book Archive