{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299375,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631729"},{"type":"electronic","value":"9783540692010"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63172-0_36","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:16:24Z","timestamp":1330298184000},"page":"129-149","source":"Crossref","is-referenced-by-count":11,"title":["An extension of models of Axiomatic Domain Theory to models of Synthetic Domain Theory"],"prefix":"10.1007","author":[{"given":"Marcelo P.","family":"Fiore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gordon D.","family":"Plotkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"J. Ad\u00e1mek and J. Rosick\u00fd: Locally Presentable and Accessible Categories. Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511600579"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"P.N. Benton, G.M. Bierman, J.M.E. Hyland, and V.C.V. de Paiva: Linear lambda calculus and categorical models revisited. In E. B\u00f6rger et al., editor, Selected Papers from Computer Science Logic '92, volume 702 of Lecture Notes in Computer Science, 1993.","DOI":"10.1007\/3-540-56992-8_6"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"G.M. Bierman: What is a categorical model of intuitionistic linear logic? In M. Dezani-Ciancaglini and G.D. Plotkin, editors, Typed Lambda Calculi and Applications, volume 902 of Lecture Notes in Computer Science, 1995.","DOI":"10.1007\/BFb0014046"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"F. Borceux: Handbook of Categorical Algebra. Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511525865"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0890-5401(92)90018-B","volume":"98","author":"R.L. Crole","year":"1992","unstructured":"R.L. Crole and A.M. Pitts: New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic. Information and Computation, 98:171\u2013210, 1992.","journal-title":"Information and Computation"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"B. Day: On closed categories of functors. In G.M. Kelly, editor, Sidney Category Seminar 1972\/1973, volume 420 of Lecture Notes in Mathematics, pages 20\u201354. Springer-Verlag, 1972.","DOI":"10.1007\/BFb0063098"},{"key":"8_CR7","volume-title":"Closed categories","author":"S. Eilenberg","year":"1966","unstructured":"S. Eilenberg and G. M. Kelly: Closed categories. In S. Eilenberg, D.K. Harrison, S. MacLane, and H. Rohrl, editors, Proceedings of the Conference on Categorical Algebra. Springer-Verlag, 1966. La Jolla, 1965."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"M.P. Fiore: Axiomatic Domain Theory in Categories of Partial Maps. Cambridge University Press Distinguished Dissertations in Computer Science, 1996.","DOI":"10.1017\/CBO9780511526565"},{"key":"8_CR9","unstructured":"M.P. Fiore: Enrichment and representation theorems for categories of domains and continuous functions. Available from http:\/\/www.dcs.ed.ac.uk\/home\/mf\/as rep.dvi, 1996."},{"issue":"5","key":"8_CR10","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1017\/S0960129597002429","volume":"7","author":"MARCELO P. FIORE","year":"1997","unstructured":"M.P. Fiore: An enrichment theorem for an axiomatisation of categories of domains and continuous functions. To appear in Mathematical Structures in Computer Science \u2014Proceedings of the Workshop LDPL'95, 1997.","journal-title":"Mathematical Structures in Computer Science"},{"key":"8_CR11","unstructured":"M.P. Fiore, A. Jung, E. Moggi, P. O'Hearn, J. Riecke, G. Rosolini, and I. Stark: Domains and denotational semantics: History, accomplishments and open problems. In number 59 of Bulletin of the European Association for Theoretical Computer Science, pages 227\u2013256, June 1996."},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0022-4049(72)90001-1","volume":"2","author":"P. Freyd","year":"1972","unstructured":"P. Freyd and G.M. Kelly: Categories of continuous functors, I. Journal of Pure and Applied Algebra, 2:169\u2013191, 1972.","journal-title":"Journal of Pure and Applied Algebra"},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0890-5401(92)90019-C","volume":"98","author":"P.J. Freyd","year":"1992","unstructured":"P.J. Freyd, P. Mulry, G. Rosolini, and D.S. Scott: Extensional PERs. Information and Computation, 98:211\u2013227, 1992.","journal-title":"Information and Computation"},{"key":"8_CR14","unstructured":"M.P. Fiore and G. Rosolini: Two models of Synthetic Domain Theory. To appear in the Journal of Pure and Applied Algebra, 1996."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"P.J. Freyd: Algebraically complete categories. In A. Carboni, M.C. Pedicchio, and G. Rosolini, editors, Category Theory, volume 1488 of Lecture Notes in Mathematics, pages 131\u2013156. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0084215"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"J.M.E. Hyland and E. Moggi: The S-replete construction. In D. Pitt, D. Rydeheard, and P. Johnstone, editors, Proceedings of the 6 th International Conference, CTCS'95, volume 953 of Lecture Notes in Computer Science, pages 96\u2013116. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60164-3_22"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"J.M.E. Hyland: First steps in Synthetic Domain Theory. In A. Carboni, M.C. Pedicchio, and G. Rosolini, editors, Category Theory, volume 1488 of Lecture Notes in Mathematics, pages 95\u2013104. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0084217"},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0168-0072(94)90020-5","volume":"69","author":"B. Jacobs","year":"1994","unstructured":"B. Jacobs: Semantics of weakening and contraction. Annals of Pure and Applied Logic, 69:73\u2013106, 1994.","journal-title":"Annals of Pure and Applied Logic"},{"key":"8_CR19","unstructured":"M. Jibladze: A presentation of the initial lift-algebra. To appear in the Journal of Pure and Applied Algebra, 1996."},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01220868","volume":"21","author":"A. Kock","year":"1970","unstructured":"A. Kock: Monads on symmetric monoidal closed categories. Arch. Math. (Basel), 21:1\u201310, 1970.","journal-title":"Arch. Math. (Basel)"},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1017\/S1446788700010272","volume":"XII","author":"A. Kock","year":"1971","unstructured":"A. Kock: Closed categories generated by commutative monads. J. Austr. Math. Soc., XII:405\u2013424, 1971.","journal-title":"J. Austr. Math. Soc."},{"key":"8_CR22","unstructured":"J.R. Longley: Realizability Toposes and Language Semantics. PhD thesis, Department of Computer Science, University of Edinburgh, 1995."},{"issue":"5","key":"8_CR23","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1017\/S0960129597002387","volume":"7","author":"JOHN R. LONGLEY","year":"1997","unstructured":"J.R. Longley and A.K. Simpson: A uniform approach to domain theory in realizability models. To appear in Mathematical Structures in Computer Science \u2014Proceedings of the Workshop LDPL'95, 1997.","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"8_CR24","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1991","unstructured":"E. Moggi: Notions of computation and monads. Information and Computation, 93(1):55\u201392, Jul 1991.","journal-title":"Information and Computation"},{"key":"8_CR25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(92)90176-G","volume":"99","author":"P. S. Mulry","year":"1992","unstructured":"P. S. Mulry: Monads and algebras in the semantics of partial data types. Theoretical Computer Science, 99:141\u2013155, 1992.","journal-title":"Theoretical Computer Science"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"W. Phoa: Effective domains and intrinsic structure. In 5 th LICS Conf., pages 366\u2013377. IEEE, Computer Society Press, 1990.","DOI":"10.1109\/LICS.1990.113762"},{"key":"8_CR27","unstructured":"G.D. Plotkin: Denotational semantics with partial functions. Lecture at C.S.L.I. Summer School, 1985."},{"key":"8_CR28","unstructured":"G.D. Plotkin: Algebraic completeness and compactness in an enriched setting. Invited lecture given at the Workshop on Logic, Domains, and Programming Languages. Darmstadt, 1995."},{"key":"8_CR29","unstructured":"J. Power and G. Rosolini: Fixpoint operators for domain equations. Available from http:\/\/hypatia.dcs.qmw.ac.uk\/, 1996."},{"key":"8_CR30","unstructured":"G. Rosolini: Continuity and Effectiveness in Topoi. PhD thesis, University of Oxford, 1986. Available from http:\/\/hypatia.dcs.qmw.ac.uk\/."},{"key":"8_CR31","unstructured":"G. Rosolini: Notes on Synthetic Domain Theory. Available from http:\/\/hypatia.dcs.qmw.ac.uk\/, 1995."},{"key":"8_CR32","unstructured":"G. Rosolini: Private communication, 1996."},{"key":"8_CR33","unstructured":"G. Rosolini. Studying repleteness in the category of cpos. To appear in Electronic Notes in Theoretical Computer Science \u2014Proceedings of MFPS XIII Conf., 1997."},{"key":"8_CR34","unstructured":"A.K. Simpson: Private communication, 1996."},{"issue":"4","key":"8_CR35","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M.B. Smyth","year":"1982","unstructured":"M.B. Smyth and G.D. Plotkin: The category-theoretic solution of recursive domain equations. SIAM Journal of Computing, 11(4):761\u2013783, 1982.","journal-title":"SIAM Journal of Computing"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"P. Taylor: The fixed point property in synthetic domain theory. In 6 th LICS Conf., pages 152\u2013160. IEEE, Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151640"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63172-0_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:39:33Z","timestamp":1742600373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63172-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631729","9783540692010"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-63172-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}