{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:49:35Z","timestamp":1775868575702,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540418641","type":"print"},{"value":"9783540453154","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_1","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:28:39Z","timestamp":1196663319000},"page":"1-24","source":"Crossref","is-referenced-by-count":65,"title":["Adequacy for Algebraic Effects"],"prefix":"10.1007","author":[{"given":"Gordon","family":"Plotkin","sequence":"first","affiliation":[]},{"given":"John","family":"Power","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"1_CR1","volume-title":"Handbook of Logic in Computer Science","author":"S. Abramsky","year":"1994","unstructured":"S. Abramsky and A. Jung, Domain Theory, in Handbook of Logic in Computer Science (eds. S. Abramsky, D.M. Gabbay and T. S. E. Maibaum), Vol. 3, Semantic Structures, Oxford: Clarendon Press, 1994."},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(96)00232-0","volume":"177","author":"S. O. Anderson","year":"1997","unstructured":"S. O. Anderson and A. J. Power, A Representable Approach to Finite Nondeterminism, Theoret. Comput. Sci., Vol. 177, No. 1, pp. 3\u201325, 1997.","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"1_CR3","first-page":"323","volume":"14","author":"E. Astesiano","year":"1980","unstructured":"E. Astesiano and G. Costa, Nondeterminism and Fully Abstract Models, in Informatique Theorique et Applications, Vol. 14, No. 4, pp. 323\u2013347, 1980.","journal-title":"Informatique Theorique et Applications"},{"issue":"6","key":"1_CR4","first-page":"665","volume":"10","author":"C. Baier","year":"2000","unstructured":"C. Baier and M. Kwiatkowska, Domain Equations for Probabilistic Processes, MSCS, Vol. 10, No. 6, pp. 665\u2013717, 2000.","journal-title":"Domain Equations for Probabilistic Processes"},{"key":"1_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 5th. Biennial Meeting on Category Theory and Computer Science","author":"P. Cenciarelli","year":"1993","unstructured":"P. Cenciarelli and E. Moggi, A Syntactic Approach to Modularity in Denotational Semantics, in Proc. 5th. Biennial Meeting on Category Theory and Computer Science, LNCS, Berlin: Springer-Verlag, 1993."},{"key":"1_CR6","first-page":"204","volume-title":"Proc. 15th LICS","author":"V. Danos","year":"2000","unstructured":"V. Danos and R. Harmer, Probabilistic Game Semantics, in Proc. 15th LICS, pp. 204\u2013213, Washington: IEEE Press, 2000."},{"key":"1_CR7","first-page":"193","volume-title":"Formal Description of Programming Concepts III","author":"M. Felleisen","year":"1986","unstructured":"M. Felleisen, and D. P. Friedman, Control Operators, the SECD-machine, and the Lambda-Calculus, in Formal Description of Programming Concepts III (ed. M. Wirsing), pp. 193\u2013217, Amsterdam: Elsevier, 1986."},{"key":"1_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10284-1","volume-title":"Algebraic Semantics","author":"I. Guessarian","year":"1981","unstructured":"I. Guessarian, Algebraic Semantics, LNCS, Vol. 99, Berlin: Springer-Verlag, 1981."},{"key":"1_CR9","first-page":"422","volume-title":"Proc. 14th LICS","author":"R. Harmer","year":"1999","unstructured":"R. Harmer and G. McCusker, A Fully Abstract Game Semantics for Finite Non-determinism, in Proc. 14th LICS, pp. 422\u2013430, Washington: IEEE Press, 1999."},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/0209005","volume":"9","author":"M. C. B. Hennessy","year":"1980","unstructured":"M. C. B. Hennessy, The Semantics of Call-By-Value and Call-By-Name in a Non-deterministic Environment, in SIAM J. Comput., Vol. 9, No. 1, pp. 67\u201384, 1980.","journal-title":"SIAM J. Comput."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(80)90015-8","volume":"11","author":"M. C. B. Hennessy","year":"1980","unstructured":"M. C. B. Hennessy and E. A. Ashcroft, A Mathematical Semantics for a Nonde-terministic Typed Lambda-Calculus, in TCS Vol. 11, pp. 227\u2013245, 1980.","journal-title":"TCS"},{"key":"1_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-09526-8_8","volume-title":"Proc. 8th MFCS","author":"M. C. B. Hennessy","year":"1979","unstructured":"M. C. B. Hennessy and G. Plotkin, Full Abstraction for a Simple Parallel Programming Language, in Proc. 8th MFCS (ed. J. Be\u0109v\u00e1r), Olomouc, Czechoslovakia, LNCS, Vol. 74, pp. 108\u2013120, Berlin: Springer-Verlag, 1979."},{"key":"1_CR13","unstructured":"C. Jones, Probabilistic Non-Determinism, Ph.D. Thesis, University of Edinburgh, Report ECS-LFCS-90-105, 1990."},{"key":"1_CR14","first-page":"186","volume-title":"Proc. 4th LICS","author":"C. Jones","year":"1989","unstructured":"C. Jones and G. D. Plotkin, A Probabilistic Powerdomain of Evaluations, in Proc. 4th LICS, Asilomar, pp. 186\u2013195, Washington: IEEE Press, 1989."},{"key":"1_CR15","volume-title":"Proc. Third COMPROX Workshop","author":"A. Jung","year":"1998","unstructured":"A. Jung and R. Tix, The Troublesome Probabilistic Powerdomain, in Proc. Third COMPROX Workshop, ENTCS, Vol. 13, Amsterdam: Elsevier, 1998."},{"key":"1_CR16","volume-title":"Basic Concepts of Enriched Category Theory","author":"G. M. Kelly","year":"1982","unstructured":"G. M. Kelly, Basic Concepts of Enriched Category Theory, Cambridge: CUP, 1982."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Y. Kinoshita and A. J. Power, Data Refinement for Call by Value Languages, submitted, 2000.","DOI":"10.1007\/3-540-48168-0_39"},{"key":"1_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/3-540-48959-2_17","volume-title":"Proc. TLCA\u2019 99","author":"P. B. Levy","year":"1999","unstructured":"P. B. Levy, Call-by-Push-Value: A Subsuming Paradigm, in Proc. TLCA\u2019 99 (ed. J.-Y. Girard), LNCS, Vol. 1581, pp. 228\u2013242, Berlin: Springer-Verlag, 1999."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"J. Mezei and J. B. Wright, Algebraic Automata and Context Free Sets, in Information and Control, Vol. 11, pp. 3\u201329, 1967.","journal-title":"Information and Control"},{"key":"1_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-44618-4_26","volume-title":"Proc. CONCUR 2000","author":"M. W. Mislove","year":"2000","unstructured":"M. W. Mislove, Nondeterminism and Probabilistic Choice: Obeying the Laws, in Proc. CONCUR 2000 (ed. C. Palamidessi), LNCS, Vol. 1877, pp. 350\u2013364, Berlin: Springer-Verlag, 2000."},{"key":"1_CR21","first-page":"14","volume-title":"Proc. LICS\u2019 89","author":"E. Moggi","year":"1989","unstructured":"E. Moggi, Computational Lambda-Calculus and Monads, in Proc. LICS\u2019 89, pp. 14\u201323, Washington: IEEE Press, 1989."},{"key":"1_CR22","unstructured":"E. Moggi, An Abstract View of Programming Languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989."},{"issue":"1","key":"1_CR23","doi-asserted-by":"publisher","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, Inf. and Comp., Vol. 93, No. 1, pp. 55\u201392, 1991.","journal-title":"Inf. and Comp."},{"issue":"3","key":"1_CR24","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. D. Plotkin","year":"1976","unstructured":"G. D. Plotkin, A Powerdomain Construction, SIAM J. Comput. Vol. 5, No. 3, pp. 452\u2013487, 1976.","journal-title":"SIAM J. Comput."},{"key":"1_CR25","unstructured":"G. D. Plotkin, Domains, ( http:\/\/www.dcs.ed.ac.uk\/home\/gdp\/ ), 1983."},{"key":"1_CR26","volume-title":"Proc. MFPS XIII","author":"A. J. Power","year":"1997","unstructured":"A. J. Power, Modularity in Denotational Semantics, in Proc. MFPS XIII (eds. S. Brookes and M. Mislove), ENTCS, Vol. 6, Amsterdam: Elsevier, 1997."},{"key":"1_CR27","unstructured":"A. J. Power, Enriched Lawvere Theories, in Lambek Festschrift (eds. M. Barr, P. Scott and R. Seely), TAC, Vol. 7, pp. 83\u201393, 2000."},{"key":"1_CR28","volume-title":"Proc. MFPS XV","author":"A. J. Power","year":"1999","unstructured":"A. J. Power and E. P. Robinson, Modularity and Dyads, in Proc. MFPS XV (eds. S. Brookes, A. Jung, M. Mislove and A. Scedrov), ENTCS Vol. 20, Amsterdam: Elsevier, 1999."},{"key":"1_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BFb0055066","volume-title":"Proc. ICALP\u2019 98","author":"A. J. Power","year":"1998","unstructured":"A. J. Power and G. Rosolini, A Modular Approach to Denotational Semantics, in Proc. ICALP\u2019 98 (eds. K. G. Larsen, S. Skyum and G. Winskel), LNCS, Vol. 1443, pp. 351\u2013362 Berlin: Springer-Verlag, 1998."},{"key":"1_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/3-540-48523-6_59","volume-title":"Proc. 26th. ICALP","author":"A. J. Power","year":"1999","unstructured":"A. J. Power and H. Thielecke, Closed Freyd-and \u041a-categories, in Proc. 26th. ICALP (eds. J. Wiedermann and P. van Emde Boas and M. Nielsen), LNCS, Vol. 1644, pp. 625\u2013634, Berlin: Springer-Verlag, 1999."},{"key":"1_CR31","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BFb0037119","volume-title":"Proc. TLCA\u2019 93","author":"K. Sieber","year":"1993","unstructured":"K. Sieber, Call-by-Value and Nondeterminism, in Proc. TLCA\u2019 93 (eds. M. Bezem and J. F. Groote), LNCS, Vol. 664, pp. 376\u2013390, Berlin: Springer-Verlag, 1993."},{"key":"1_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/10703163_22","volume-title":"Proc. CSL\u2019 98","author":"A. Simpson","year":"1999","unstructured":"A. Simpson, Computational Adequacy in an Elementary Topos, in Proc. CSL\u2019 98, LNCS, Vol. 1584, pp. 323\u2013342, Berlin: Springer-Verlag, 1999."},{"key":"1_CR33","first-page":"268","volume-title":"Proc. LICS 97","author":"D. Turi","year":"1997","unstructured":"D. Turi and G. D. Plotkin, Towards a Mathematical Operational Semantics, in Proc. LICS 97, pp. 268\u2013279, Washington: IEEE Press, 1997."},{"key":"1_CR34","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages","author":"G. Winskel","year":"1993","unstructured":"G. Winskel, The Formal Semantics of Programming Languages, Cambridge: MIT Press, 1993."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T02:53:59Z","timestamp":1588128839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}