CTCS 1991: Category Theory and Computer Science pp 37-52 | Cite as
Categories of information systems
Conference paper
First Online:
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.
Keywords
Partial Order Compact Object Information Category Stone Space Domain Equation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- [Abr88]S. Abramsky. A cooks tour of the finitary non-well founded sets (abstract). EATCS Bulletin, 36:233–234, 1988.Google Scholar
- [Bar77]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.Google Scholar
- [Cut80]N. J. Cutland. Computability: An Introduction to Recursive function theory. Cambridge University Press, 1980.Google Scholar
- [Eda89]A. Edalat. Categories of information systems. Master's thesis, Imperial College, University of London, 1989.Google Scholar
- [ES91]A. Edalat and M. B. Smyth. Categories of Information Systems. Technical Report Doc-91-21, Imperial College, London, 1991.Google Scholar
- [FG82]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.Google Scholar
- [Gun87]C. Gunter. Universal profinite domains. Information and Computation, 72(1):1–30, 1987.Google Scholar
- [Joh82]P. T. Johnstone. Stone Space, volume 3 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1982.Google Scholar
- [LS86]J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics Vol. 7. Cambridge University Press, 1986.Google Scholar
- [LW84]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.Google Scholar
- [MA86]E. Manes and M. A. Arbib. Algebraic Approaches to Program Semantics. Springer-Verlag, 1986.Google Scholar
- [Plo81]G. D. Plotkin. Post-graduate lecture notes in advanced domain theory (incorporating the “Pisa Notes”). Dept. of Computer Science, Univ. of Edinburgh, 1981.Google Scholar
- [Sco82]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.Google Scholar
- [Smy83]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.Google Scholar
- [Vic88]S. J. Vickers. Topology Via Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1988.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1991