{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:26:13Z","timestamp":1725456373781},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354054495X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013456","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:51:37Z","timestamp":1132728697000},"page":"37-52","source":"Crossref","is-referenced-by-count":3,"title":["Categories of information systems"],"prefix":"10.1007","author":[{"given":"Abbas","family":"Edalat","sequence":"first","affiliation":[]},{"given":"Michael B.","family":"Smyth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","first-page":"233","volume":"36","author":"S. Abramsky","year":"1988","unstructured":"S. Abramsky. A cooks tour of the finitary non-well founded sets (abstract). EATCS Bulletin, 36:233\u2013234, 1988.","journal-title":"EATCS Bulletin"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"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\u201346. North Holland, 1977.","DOI":"10.1016\/S0049-237X(08)71097-8"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"N. J. Cutland. Computability: An Introduction to Recursive function theory. Cambridge University Press, 1980.","DOI":"10.1017\/CBO9781139171496"},{"key":"4_CR4","unstructured":"A. Edalat. Categories of information systems. Master's thesis, Imperial College, University of London, 1989."},{"key":"4_CR5","series-title":"Technical Report","volume-title":"Categories of Information Systems","author":"A. Edalat","year":"1991","unstructured":"A. Edalat and M. B. Smyth. Categories of Information Systems. Technical Report Doc-91-21, Imperial College, London, 1991."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013121. North Holland, 1982.","DOI":"10.1016\/S0049-237X(09)70126-0"},{"issue":"1","key":"4_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(87)90048-4","volume":"72","author":"C. Gunter","year":"1987","unstructured":"C. Gunter. Universal profinite domains. Information and Computation, 72(1):1\u201330, 1987.","journal-title":"Information and Computation"},{"key":"4_CR8","volume-title":"Stone Space, volume 3 of Cambridge Studies in Advanced Mathematics","author":"P. T. Johnstone","year":"1982","unstructured":"P. T. Johnstone. Stone Space, volume 3 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1982."},{"key":"4_CR9","unstructured":"J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics Vol. 7. Cambridge University Press, 1986."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-13346-1_5","volume-title":"Semantics of Data Types","author":"K. G. Larsen","year":"1984","unstructured":"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\u2013130, Berlin, 1984. Springer-Verlag. Lecture Notes in Computer Science Vol. 173."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"E. Manes and M. A. Arbib. Algebraic Approaches to Program Semantics. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4962-7"},{"key":"4_CR12","unstructured":"G. D. Plotkin. Post-graduate lecture notes in advanced domain theory (incorporating the \u201cPisa Notes\u201d). Dept. of Computer Science, Univ. of Edinburgh, 1981."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/BFb0012801"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1007\/BFb0036946","volume-title":"Automata, Languages and Programming","author":"M. B. Smyth","year":"1983","unstructured":"M. B. Smyth. Powerdomains and predicate transformers: a topological view. In J. Diaz, editor, Automata, Languages and Programming, pages 662\u2013675, Berlin, 1983. Springer-Verlag. Lecture Notes in Computer Science Vol. 154."},{"key":"4_CR15","unstructured":"S. J. Vickers. Topology Via Logic. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1988."}],"container-title":["Lecture Notes in Computer Science","Category Theory and Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013456.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:07:51Z","timestamp":1607353671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013456"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354054495X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0013456","relation":{},"subject":[]}}