{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:08:33Z","timestamp":1710356913266},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Categor Struct"],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bf00880044","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T07:26:11Z","timestamp":1104132371000},"page":"197-232","source":"Crossref","is-referenced-by-count":4,"title":["Information categories"],"prefix":"10.1007","volume":"1","author":[{"given":"Abbas","family":"Edalat","sequence":"first","affiliation":[]},{"given":"Michael B.","family":"Smyth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Artin, M., A. Grothendick, and J.L. Verdier: 1972, ?Th\u00e9orie des toppos et cohomologie \u00e9tale des sch\u00e9mas (sga 4)?,Lecture Notes in Mathematics 269, 413.","DOI":"10.1007\/BFb0081551"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Barwise, K.J.: 1977, ?An introduction to first order logic?, in: K.J. Barwise, ed.,The Handbook of Mathematical Logic, Studies in Logic and Foundations of Mathematics, pp. 5?46, North-Holland.","DOI":"10.1016\/S0049-237X(08)71097-8"},{"key":"CR3","series-title":"Report of Ecole Nationale Superieure des Mines de Paris","volume-title":"Sequential algorithms on concrete data structures","author":"G. Berry","year":"1981","unstructured":"Berry, G. and P.-L. Curien: 1981, ?Sequential algorithms on concrete data structures?. Technical report, Report of Ecole Nationale Superieure des Mines de Paris, Centre de Mathematiques Appliqu\u00e9es, Sophia Antipolis."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Berry, G.: 1978, ?Stable models of types ?-calculi?, in:Proceedings of the 5th International Colloquium on Automata, Languages and Programming, volume 62 ofLecture Notes in Computer Science, pp. 72?89. Springer-Verlag.","DOI":"10.1007\/3-540-08860-1_7"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Batarekh, A. and V.S. Subrahmanian: 1989, ?The query topology in logic programming?, in: B. Monien R. Cori, ed.,STACS 89, pp. 375?387. Springer-Verlag. Lecture Notes in Computer Science Vol. 349.","DOI":"10.1007\/BFb0029000"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Coquand, T., C. Gunter, and G. Winskel: 1987, ?dI-domains as a model of polymorphism?, in:Third Workshop on the Mathematical Foundations of Programming Language Semantics, pp. 344?363. Springer-Verlag.","DOI":"10.1007\/3-540-19020-1_18"},{"key":"CR7","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"1990","unstructured":"Davey, B.A. and H.A. Priestley: 1990,Introduction to Lattices and Order, Cambridge University Press, Cambridge."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Edalat, A. and M.B. Smyth: 1991, ?Categories of information systems?, in: D.H. Pitt, P.L. Curien, S. Abramsky, A.M. Pitts, A. Poigne, and D.E. Rydeheard, eds.,Category Theory in Computer Science, pp. 37?52. Springer-Verlag.","DOI":"10.1007\/BFb0013456"},{"key":"CR9","unstructured":"Edalat, A. and M.B. Smyth: 1991, ?Categories of information systems?, Technical Report Doc 91\/21, Department of Computing, Imperial College."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Edalat, A. and M.B. Smyth: 1992, ?I-categories as a framework for solving domain equation?,Theoretical Computer Science, to appear.","DOI":"10.1016\/0304-3975(93)90056-Y"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Edalat, A. and M.B. Smyth: 1992, ?Metric information system?, to appear.","DOI":"10.1007\/3-540-56596-5_33"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Fourman, M.P. and R.J. Grayson: 1982, ?Formal spaces?, in: A.S. Trolstra and D. van Dalen, eds.,The L.E.J. Brouwer Centenary Symposium, pp. 107?121. North Holland.","DOI":"10.1016\/S0049-237X(09)70126-0"},{"key":"CR13","volume-title":"Abelian Categories: An Introduction to the Theory of Functors","author":"P. Freyd","year":"1964","unstructured":"Freyd, P.: 1964,Abelian Categories: An Introduction to the Theory of Functors, Harper and Row, New York."},{"key":"CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77487-9","volume-title":"Universal Algebra","author":"G. Graetzer","year":"1979","unstructured":"Graetzer, G.: 1979,Universal Algebra, Springer Verlag, Berlin, Heidelberg, New York, 2nd edition.","edition":"2nd edition"},{"issue":"1","key":"CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(87)90048-4","volume":"72","author":"C. Gunter","year":"1987","unstructured":"Gunter, C.: 1987, ?Universal profinite domains?,Information and Computation 72 (1), 1?30.","journal-title":"Information and Computation"},{"key":"CR16","unstructured":"Halmos, P.R.: 1963,Lectures on Boolean Algebras, Number 1 in Van Nostrand Mathematical Studies, Princeton."},{"key":"CR17","unstructured":"Jung, A.: 1988,Cartesian Closed Categories of Domains. PhD thesis, Technische Hochschule Darmstadt."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W.: 1987,Foundations of Logic Programming, Springer-Verlag.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"CR19","unstructured":"Lambek, J. and P.J. Scott: 1986,Introduction to Higher Order Categorical Logic, Cambridge Studies in Advanced Mathematics Vol. 7. Cambridge University Press."},{"key":"CR20","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":"Larsen, K.G. and G. Winskel: 1984, ?Using information systems to solve recursive domain equations effectively?, in: D.B. MacQueen, G. Kahn, and G. Plotkin, eds.,Semantics of Data Types, pp. 109?130, Berlin, Springer-Verlag. Lecture Notes in Computer Science Vol. 173."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Manes, E. and M.A. Arbib: 1986,Algebraic Approaches to Program Semantics, Springer-Verlag.","DOI":"10.1007\/978-1-4612-4962-7"},{"key":"CR22","unstructured":"Plotkin, G.D.: 1981, ?Post-graduate lecture notes in advanced domain theory (incorporating the ?Pisa Notes?). Dept. of Computer Science, Univ. of Edinburgh."},{"key":"CR23","series-title":"Lecture Note in Mathematics","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BFb0073967","volume-title":"Toposes, Algebraic Geometry and Logic","author":"D.S. Scott","year":"1972","unstructured":"Scott, D.S.: 1972, ?Continuous lattices?, in: E. Lawvere, ed.,Toposes, Algebraic Geometry and Logic, pp. 97?136. Springer-Verlag, Berlin. Lecture Note in Mathematics 274."},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Scott, D.S.: 1980, ?Some models, som philosophy?, in: J. Barwise, H.J. Keisler, and K. Kunen, eds.,The Kleene Symposium, pp. 223?265. North-Holland Publishing Company.","DOI":"10.1016\/S0049-237X(08)71262-X"},{"key":"CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming: Proceedings 1982","author":"D.S. Scott","year":"1982","unstructured":"Scott, D.S.: 1982, ?Domains for denotational semantics?, in: M. Nielson and E.M. Schmidt, eds.,Automata, Languages and Programming: Proceedings 1982, Lecture Notes in Computer Science No. 140, Springer-Verlag, Berlin."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","volume":"5","author":"M.B. Smyth","year":"1977","unstructured":"Smyth, M.B.: 1977, ?Effectively given domains?,Theoretical Computer Science 5, 257?274.","journal-title":"Theoretical Computer Science"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(83)90095-6","volume":"27","author":"M.B. Smyth","year":"1983","unstructured":"Smyth, M.B.: 1983, ?The largest cartesian closed category of domains?,Theoretical Computer Science 27, 109?119.","journal-title":"Theoretical Computer Science"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1112\/jlms\/s2-45.2.321","volume":"45","author":"M.B. Smyth","year":"1992","unstructured":"Smyth, M.B.: 1992, ?Stable compactification i?,J. London Math. Soc. (2) 45, 321?340.","journal-title":"J. London Math. Soc. (2)"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M.B. Smyth","year":"1982","unstructured":"Smyth, M.B. and G.D. Plotkin: 1982, ?The category-theoretic solution of recursive domain equations?,SIAM J. Computing 11, 761?783.","journal-title":"SIAM J. Computing"},{"key":"CR30","unstructured":"Tennent, R.D.: 1991,Semantics of Programming Languages, Prentice Hall."},{"key":"CR31","series-title":"Lecture Notes in Computer Science","first-page":"325","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"G. Winskel","year":"1986","unstructured":"Winskel, G.: 1986, ?Event structures?, in:Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science Vol. 255, Springer-Verlag, Berlin, pp. 325?392."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1007\/BFb0035798","volume-title":"Automata, Languages and Programming","author":"G.Q. Zhang","year":"1989","unstructured":"Zhang, G.Q.: 1989, ?dI-domains as information systems?, in: G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, eds.,Automata, Languages and Programming, volume 372 ofLecture Notes in Computer Science, Springer Verlag, Berlin, pp. 773?788."}],"container-title":["Applied Categorical Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00880044.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00880044\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00880044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T04:03:05Z","timestamp":1682913785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00880044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF00880044"],"URL":"https:\/\/doi.org\/10.1007\/bf00880044","relation":{},"ISSN":["0927-2852","1572-9095"],"issn-type":[{"value":"0927-2852","type":"print"},{"value":"1572-9095","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}