{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:31Z","timestamp":1759638931899},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433668"},{"type":"electronic","value":"9783540459316"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45931-6_11","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:53:52Z","timestamp":1181350432000},"page":"144-159","source":"Crossref","is-referenced-by-count":10,"title":["Varieties of Effects"],"prefix":"10.1007","author":[{"given":"Carsten","family":"F\u00fchrmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Anna Bucalo, Carsten F\u00fchrmann, and Alex Simpson. An equational notion of lifting monad. Theoretical Computer Science, to appear.","key":"11_CR1","DOI":"10.1016\/S0304-3975(01)00243-2"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01019943","volume":"7","author":"A. Filinski","year":"1994","unstructured":"Andrzej Filinski. Recursion from iteration. Lisp and Symbolic Computation,, 7(1):11\u201338, 1994.","journal-title":"Lisp and Symbolic Computation"},{"key":"11_CR3","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proceedings MFPS XV","author":"C. F\u00fchrmann","year":"1999","unstructured":"Carsten F\u00fchrmann. Direct models of the computational lambda-calculus. In Proceedings MFPS XV, volume 20 of Electronic Notes in Theoretical Computer Science, New Orleans, 1999. Elsevier."},{"unstructured":"Carsten F\u00fchrmann. The structure of call-by-value. PhD thesis, Division of Informatics, University of Edinburgh, 2000.","key":"11_CR4"},{"unstructured":"Masahito Hasegawa and Yoshihiko Kakutani. Axioms for recursion in call-by-value. Higher-Order and Symbolic Computation, To appear.","key":"11_CR5"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01304852","volume":"23","author":"A. Kock","year":"1972","unstructured":"A. Kock. Strong functors and monoidal monads. Archive der Mathematik, 23:113\u2013120, 1972.","journal-title":"Archive der Mathematik"},{"unstructured":"E. Moggi. Computational lambda-calculus and monads. Technical Report ECSLFCS-88-66, Edinburgh Univ., Dept. of Comp. Sci., 1988.","key":"11_CR7"},{"doi-asserted-by":"crossref","unstructured":"E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.","key":"11_CR8","DOI":"10.1016\/0890-5401(91)90052-4"},{"doi-asserted-by":"crossref","unstructured":"Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, 1999.","key":"11_CR9","DOI":"10.1007\/978-3-662-03811-6"},{"issue":"5","key":"11_CR10","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0960129597002375","volume":"7","author":"J. Power","year":"1997","unstructured":"John Power and Edmund Robinson. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science, 7(5):453\u2013468, October 1997.","journal-title":"Mathematical Structures in Computer Science"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1017\/S096012950000311X","volume":"11","author":"P. Selinger","year":"2001","unstructured":"Peter Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science, 11:207\u2013260, 2001.","journal-title":"Mathematical Structures in Computer Science"},{"unstructured":"Hayo Thielecke. Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, 1997.","key":"11_CR12"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1010068800499","volume":"12","author":"H. Thielecke","year":"1999","unstructured":"Hayo Thielecke. Using a continuation twice and its implications for the expressive power of call\/cc. Higher-Order and Symbolic Computation, 12(1):47\u201374, 1999.","journal-title":"Higher-Order and Symbolic Computation"}],"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-45931-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:19:20Z","timestamp":1556479160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45931-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433668","9783540459316"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45931-6_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}