Abstract
An abstract notion of “information category” (I-category) is introduced as a generalization of Scott's well-known category of information systems. The proposed axioms introduce a global partial order on the morphisms of the category, making them an ω-algebraic cpo. An initial algebra theorem for a class of endofunctors continuous on the cpo of morphisms is proved, thus giving canonical solution of domain equations. An effective version of these results, in the general setting, is also provided. Some basic examples of categories of information systems are dealt with.
Extended Abstract
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky. A cooks tour of the finitary non-well founded sets (abstract). EATCS Bulletin, 36:233–234, 1988.
K. J. Barwise. An introduction to first order logic. In K. J. Barwise, editor, The Handbook of Mathematical Logic, Studies in Logic and Foundations of Mathematics, pages 5–46. North Holland, 1977.
N. J. Cutland. Computability: An Introduction to Recursive function theory. Cambridge University Press, 1980.
A. Edalat. Categories of information systems. Master's thesis, Imperial College, University of London, 1989.
A. Edalat and M. B. Smyth. Categories of Information Systems. Technical Report Doc-91-21, Imperial College, London, 1991.
M. P. Fourman and R. J. Grayson. Formal spaces. In A. S. Trolstra and D. van Dalen, editors, The L.E.J.Brouwer Centenary Symposium, pages 107–121. North Holland, 1982.
C. Gunter. Universal profinite domains. Information and Computation, 72(1):1–30, 1987.
P. T. Johnstone. Stone Space, volume 3 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1982.
J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics Vol. 7. Cambridge University Press, 1986.
K. G. Larsen and G. Winskel. Using information systems to solve recursive domain equations effectively. In D. B. MacQueen G. Kahn and G. Plotkin, editors, Semantics of Data Types, pages 109–130, Berlin, 1984. Springer-Verlag. Lecture Notes in Computer Science Vol. 173.
E. Manes and M. A. Arbib. Algebraic Approaches to Program Semantics. Springer-Verlag, 1986.
G. D. Plotkin. Post-graduate lecture notes in advanced domain theory (incorporating the “Pisa Notes”). Dept. of Computer Science, Univ. of Edinburgh, 1981.
D. S. Scott. Domains for denotational semantics. In M. Nielson and E. M. Schmidt, editors, Automata, Languages and Programming: Proceedings 1982. Springer-Verlag, Berlin, 1982. Lecture Notes in Computer Science 140.
M. B. Smyth. Powerdomains and predicate transformers: a topological view. In J. Diaz, editor, Automata, Languages and Programming, pages 662–675, Berlin, 1983. Springer-Verlag. Lecture Notes in Computer Science Vol. 154.
S. J. Vickers. Topology Via Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Edalat, A., Smyth, M.B. (1991). Categories of information systems. In: Pitt, D.H., Curien, PL., Abramsky, S., Pitts, A.M., Poigné, A., Rydeheard, D.E. (eds) Category Theory and Computer Science. CTCS 1991. Lecture Notes in Computer Science, vol 530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013456
Download citation
DOI: https://doi.org/10.1007/BFb0013456
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54495-1
Online ISBN: 978-3-540-38413-7
eBook Packages: Springer Book Archive