{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:42:41Z","timestamp":1725496961018},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418641"},{"type":"electronic","value":"9783540453154"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_16","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:28:39Z","timestamp":1196663319000},"page":"246-260","source":"Crossref","is-referenced-by-count":2,"title":["Axioms for Recursion in Call-by-Value"],"prefix":"10.1007","author":[{"given":"Masahito","family":"Hasegawa","sequence":"first","affiliation":[]},{"given":"Yoshihiko","family":"Kakutani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Bloom, S. and Esik, Z. (1993) Iteration Theories. EATCS Monographs on Theoretical Computer Science, Springer-Verlag.","DOI":"10.1007\/978-3-642-78034-9"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(92)90018-B","volume":"98","author":"R.L. Crole","year":"1992","unstructured":"Crole, R.L. and Pitts, A.M. (1992) New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic. Inform. and Comput. 98(2), 171\u2013210.","journal-title":"Inform. and Comput."},{"key":"16_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BFb0018355","volume-title":"Proc. Category Theory and Computer Science","author":"A. Filinski","year":"1989","unstructured":"Filinski, A. (1989) Declarative continuations: an investigation of duality in programming language semantics. In Proc. Category Theory and Computer Science, Springer Lecture Notes in Comput. Sci. 389, pp. 224\u2013249."},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01019943","volume":"7","author":"A. Filinski","year":"1994","unstructured":"Filinski, A.(1994) Recursion from iteration. Lisp and Symbolic Comput. 7(1),11\u201338.","journal-title":"Lisp and Symbolic Comput."},{"key":"16_CR5","unstructured":"Filinski, A. (1996) Controlling Effects. PhD thesis, Carnegie Mellon University, CMU-CS-96-119."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Sabry, A., Duba, B.F. and Felleisen, M. (1993) The essence of compiling with continuations. In Proc. ACM Conference on Programming Languages Design and Implementation, pp. 237\u2013247.","DOI":"10.1145\/155090.155113"},{"key":"16_CR7","unstructured":"Fuhrmann, C. (2000) The Structure of Call-by-Value. PhD thesis, University of Edinburgh."},{"issue":"4","key":"16_CR8","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1017\/S095679680000085X","volume":"3","author":"R. Harper","year":"1993","unstructured":"Harper, R., Duba, B.F. and MacQueen, D. (1993) Typing first-class continuations in ML. J. Funct. Programming 3(4), 465\u2013484.","journal-title":"J. Funct. Programming"},{"key":"16_CR9","unstructured":"Hasegawa, M. (1997) Models of Sharing Graphs: A Categorical Semantics of let and letrec. PhD thesis, University of Edinburgh, ECS-LFCS-97-360; also in Distinguished Dissertation Series, Springer-Verlag, 1999."},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1017\/S0960129500001195","volume":"5","author":"M. Hofmann","year":"1995","unstructured":"Hofmann, M. (1995) Sound and complete axiomatisations of call-by-value control operators. Math. Structures Comput. Sci. 5(4), 461\u2013482.","journal-title":"Math. Structures Comput. Sci."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Kakutani, Y. (2001) Duality between Call-by-Name Recursion and Call-by-Value Iteration. MSc thesis, Kyoto University.","DOI":"10.1007\/3-540-45793-3_34"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Moggi, E. (1989) Computational lambda-calculus and monads. In Proc. 4th Annual Symposium on Logic in Computer Science, pp. 14\u201323.","DOI":"10.1109\/LICS.1989.39155"},{"key":"16_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Proc. International Conference on Logic Programming and Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"Parigot, M. (1992) \u03bb\u03bc-calculus: an algorithmic interpretation of classical natural deduction. In Proc. International Conference on Logic Programming and Automated Reasoning, Springer Lecture Notes in Comput. Sci. 624, pp. 190\u2013201."},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D. (1975) Call-by-name, call-by-value, and the \u03bb-calculus. Theoret. Comput. Sci. 1(1), 125\u2013159.","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"16_CR15","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0960129597002375","volume":"7","author":"A.J. Power","year":"1997","unstructured":"Power, A.J. and Robinson, E.P. (1997) Premonoidal categories and notions of computation. Math. Structures Comput. Sci. 7(5), 453\u2013468.","journal-title":"Math. Structures Comput. Sci."},{"issue":"3\/4","key":"16_CR16","first-page":"288","volume":"6","author":"A. Sabry","year":"1993","unstructured":"Sabry, A. and Felleisen, M. (1992) Reasoning about programs in continuation-passing style. In Proc. ACM Conference on Lisp and Functional Programming, pp. 288\u2013298; extended version in Lisp and Symbolic Comput. 6(3\/4), 289-360, 1993.","journal-title":"Proc. ACM Conference on Lisp and Functional Programming"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Selinger, P. (2001) Control categories and duality: on the categorical semantics of the lambda-mu calculus. To appear in Math. Structures Comput. Sci.","DOI":"10.1017\/S096012950000311X"},{"key":"16_CR18","unstructured":"Simpson, A.K. and Plotkin, G.D. (2000) Complete axioms for categorical fixedpoint operators. In Proc. 15th Annual Symposium on Logic in Computer Science."},{"key":"16_CR19","unstructured":"Thielecke, H. (1997) Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, ECS-LFCS-97-376."},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1010068800499","volume":"12","author":"H. Thielecke","year":"1999","unstructured":"Thielecke, H. (1999) Using a continuation twice and its implications for the expressive power of call\/cc. Higher-Order and Symbolic Comput. 12(1), 47\u201373.","journal-title":"Higher-Order and Symbolic Comput."}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T13:10:08Z","timestamp":1557061808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}