{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:06Z","timestamp":1742591406063,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540168164"},{"type":"electronic","value":"9783540448617"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16816-8_27","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:05:58Z","timestamp":1330196758000},"page":"101-121","source":"Crossref","is-referenced-by-count":2,"title":["Comparing categories of domains"],"prefix":"10.1007","author":[{"given":"Carl A.","family":"Gunter","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"6_CR1","unstructured":"Arbib, M. and Manes, E. G., Structures and Functors: the Categorical Imperative. Academic Press, 1975, 185 pp."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Coppo, M., Dezani, M. and Longo, G., Applicative information systems. In: Trees in Algebra and Programming, L'Aquila, edited by G. Ausiello and M. Protasi. Lecture Notes in Computer Science, vol. 159, Springer-Verlag, 1983, pp. 35\u201364.","DOI":"10.1007\/3-540-12727-5_2"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M. and Scott, D. S., A Compendium of Continuous Lattices. Springer-Verlag, 1981, 371 pp.","DOI":"10.1007\/978-3-642-67678-9"},{"key":"6_CR4","volume-title":"Profinite Solutions for Recursive Domain Equations","author":"C. Gunter","year":"1985","unstructured":"Gunter, C., Profinite Solutions for Recursive Domain Equations. Doctoral Dissertation, University of Wisconsin, Madison, 1985, 181 pp."},{"key":"6_CR5","unstructured":"Herrlich, H. and Strecker, G., Category Theory. Allyn and Bacon Inc., 1973, 400 pp."},{"key":"6_CR6","unstructured":"Kamimura, T. and Tang, A., Finitely continuous posets. To appear in Theoretical Computer Science, 1985."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Kanda, A., Fully effective solutions of recursive domain equations. In: MFCS 79, edited by J. Be\u010dva\u0159. Lecture Notes in Computer Science, vol. 74, Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09526-8_30"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Kanda, A., Effective Solutions of Recursive Domain Equations, Doctoral Dissertation, Warwick University, 1980.","DOI":"10.1007\/3-540-09526-8_30"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0019-9958(82)90796-3","volume":"52","author":"C. P. J. Koymans","year":"1982","unstructured":"Koymans, C. P. J., Models of the labda calculus. Information and Control, vol. 52, 1982, pp. 306\u2013332.","journal-title":"Information and Control"},{"key":"6_CR10","unstructured":"Lambek J., From lambda-calculus to cartesian closed categories. In: To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, edited by J. P. Seldin and R. Hindley. Academic Press, 1980, pp. 375\u2013402."},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01752392","volume":"14","author":"D. J. Lehmann","year":"1981","unstructured":"Lehmann, D. J., and Smyth M. B., Algebraic specification of data types: a synthetic approach. Mathematical Systems Theory, vol. 14, 1981, pp. 97\u2013139.","journal-title":"Mathematical Systems Theory"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Longo, G. and Moggi, E., Cartesian closed categories of enumerations for effective type structures (parts I and II). In: Semantics of Data Types, Sophia-Antipolis, edited by G. Kahn and G. D. Plotkin. Lecture Notes in Computer Science, vol. 173, Springer-Verlag, 1984, pp. 235\u2013256.","DOI":"10.1007\/3-540-13346-1_12"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"MacLane, S., Categories for the Working Mathematician. Springer-Verlag, 1971, 262 pp.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"6_CR14","volume-title":"Realizability and Recursive Mathematics","author":"D. McCarty","year":"1984","unstructured":"McCarty, D., Realizability and Recursive Mathematics. Doctoral Dissertation, Merton College, Oxford, 1984, 281 pp."},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. D. Plotkin","year":"1976","unstructured":"Plotkin, G. D., A powerdomain construction. SIAM Journal of Computing, vol. 5, 1976, pp. 452\u2013487.","journal-title":"SIAM Journal of Computing"},{"key":"6_CR16","unstructured":"Plotkin, G. D., The category of complete partial orders: a tool for making meanings. In: Proceedings of the Summer School on foundations of Artificial Intelligence and Computer Science, Instituto di Scienze dell'Informazione, University di Pisa, 1978."},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(78)90006-5","volume":"17","author":"G. D. Plotkin","year":"1978","unstructured":"Plotkin, G. D., T w as a universal domain. Journal of Computer System Sciences, vol. 17, 1978, pp. 209\u2013236.","journal-title":"Journal of Computer System Sciences"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Scott, D. S., Continuous lattices. In: Toposes, Algebraic Geometry and Logic, edited by F. W. Lawvere. Lecture Notes in Mathematics, vol. 274, Springer-Verlag, 1972, pp. 97\u2013136.","DOI":"10.1007\/BFb0073967"},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D.S. Scott","year":"1976","unstructured":"Scott, D.S., Data types as lattices. SIAM Journal of Computing, vol. 5, 1976, pp. 522\u2013587.","journal-title":"SIAM Journal of Computing"},{"key":"6_CR20","unstructured":"Scott, D. S., Relating theories of the \u03bb-calculus. In: To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, edited by J. P. Seldin and R. Hindley. Academic Press, 1980, pp. 403\u2013450."},{"key":"6_CR21","unstructured":"Scott, D. S., Lectures on a mathematical theory of computation. Technical Report, no. PRG-19, Oxford University Computing Laboratory, 1981, 148 pp."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Scott, D. S., Some ordered sets in computer science. In: Ordered Sets, Banff, Canada, edited by I. Rival. D. Reidel Publishing Company, 1981, pp. 677\u2013718.","DOI":"10.1007\/978-94-009-7798-3_22"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Scott, D. S., Domains for denotational semantics. In: ICALP 82, Aarhus, Denmark, edited by M. Nielsen and E. M. Schmidt. Lecture Notes in Computer Science, vol. 140, Springer-Verlag, 1982, pp. 577\u2013613.","DOI":"10.1007\/BFb0012801"},{"key":"6_CR24","unstructured":"Scott, D. S., and Strachey, C., Toward a mathematical semantics for computer languages. Technical Report, no. PRG-6, Oxford University Computing Laboratory, 1971."},{"key":"6_CR25","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., Effectively given domains. Theoretical Computer Science vol. 5, 1977, pp. 257\u2013274.","journal-title":"Theoretical Computer Science"},{"key":"6_CR26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","volume":"16","author":"M. B. Smyth","year":"1978","unstructured":"Smyth, M. B., Powerdomains. Journal of Computer System Sciences, vol. 16, 1978, pp. 23\u201336.","journal-title":"Journal of Computer System Sciences"},{"key":"6_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., The largest cartesian closed category of domains. Theoretical Computer Science, vol. 27, 1983, pp 109\u2013119.","journal-title":"Theoretical Computer Science"},{"key":"6_CR28","unstructured":"Smyth, M. B., Powerdomains and predicate transformers: a topological view. In: ICALP 83, edited by J. Diaz. Lecture Notes in Computer Science, vol. 154, Springer-Verlag, 1983, pp. 662\u2013676."},{"key":"6_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 Plotkin, G. D., The category-theoretic solution of recursive domain equations. SIAM Journal of Computing, vol. 11, 1982, pp. 761\u2013783.","journal-title":"SIAM Journal of Computing"},{"key":"6_CR30","unstructured":"Stoy, J. E., Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. M.I.T. Press, 1977, 414 pp."},{"key":"6_CR31","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(83)90083-X","volume":"26","author":"M. Wand","year":"1983","unstructured":"Wand, M., Fixed point constructions in order-enriched categories. Theoretical Computer Scence, vol. 26, 1983, pp. 131\u2013147.","journal-title":"Theoretical Computer Scence"},{"key":"6_CR32","unstructured":"Weihrauch, K. and Deil, T., Berechenbarkeit auf cpo's. Technical Report no. 63, RWTH, Aachen, 1980, 101 pp."},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Winskel, G. and Larsen, K., Using information systems to solve recursive domain equations effectively. In: Semantics of Data Types, Sophia-Antipolis, edited by G. Kahn and G. D. Plotkin. Lecture Notes in Computer Science, vol. 173, Springer-Verlag, 1984, pp. 109\u2013130.","DOI":"10.1007\/3-540-13346-1_5"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16816-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:32:27Z","timestamp":1742589147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16816-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540168164","9783540448617"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-16816-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}