{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:44:37Z","timestamp":1725806677821},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319127354"},{"type":"electronic","value":"9783319127361"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12736-1_23","type":"book-chapter","created":{"date-parts":[[2014,10,13]],"date-time":"2014-10-13T14:53:24Z","timestamp":1413212004000},"page":"428-448","source":"Crossref","is-referenced-by-count":3,"title":["Call-by-Value in a Basic Logic for Interaction"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Sch\u00f6pp","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"23_CR1","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1017\/S0960129502003730","volume":"12","author":"S. Abramsky","year":"2002","unstructured":"Abramsky, S., Haghverdi, E., Scott, P.: Geometry of interaction and linear combinatory algebras. Mathematical Structures in Computer Science\u00a012(5), 625\u2013665 (2002)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. Comput.\u00a0163(2), 409\u2013470 (2000)","journal-title":"Inf. Comput."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0028004","volume-title":"Computer Science Logic","author":"S. Abramsky","year":"1998","unstructured":"Abramsky, S., McCusker, G.: Call-by-value games. In: Nielsen, M., Thomas, W. (eds.) CSL 1997. LNCS, vol.\u00a01414, pp. 1\u201317. Springer, Heidelberg (1998)"},{"key":"23_CR4","unstructured":"Appel, A.W.: Compiling with Continuations. Cambridge University Press (2006)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-45500-0_21","volume-title":"Theoretical Aspects of Computer Software","author":"A. Banerjee","year":"2001","unstructured":"Banerjee, A., Heintze, N., Riecke, J.G.: Design and correctness of program transformations based on control-flow analysis. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 420\u2013447. Springer, Heidelberg (2001)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Cejtin, H., Jagannathan, S., Weeks, S.: Flow-directed closure conversion for typed languages. In: Smolka, G. (ed.) ESOP\/ETAPS 2000. LNCS, vol.\u00a01782, pp. 56\u201371. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-46425-5_4"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-11957-6_12","volume-title":"Programming Languages and Systems","author":"U. Lago Dal","year":"2010","unstructured":"Dal Lago, U., Sch\u00f6pp, U.: Functional programming in sublinear space. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol.\u00a06012, pp. 205\u2013225. Springer, Heidelberg (2010)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Fischer, M.J.: Lambda calculus schemata. SIGACT News\u00a0(14), 104\u2013109 (1972)","DOI":"10.1145\/942580.807077"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Fredriksson, O., Ghica, D.R.: Abstract machines for game semantics, revisited. In: LICS, pp. 560\u2013569. IEEE (2013)","DOI":"10.1109\/LICS.2013.63"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Ghica, D.R.: Geometry of synthesis: A structured approach to VLSI design. In: Hofmann, M., Felleisen, M. (eds.) POPL, pp. 363\u2013375. ACM (2007)","DOI":"10.1145\/1190215.1190269"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Ghica, D.R., Smith, A., Singh, S.: Geometry of synthesis IV: Compiling affine recursion into static hardware. In: Chakravarty, M.M.T., Hu, Z., Danvy, O. (eds.) ICFP, pp. 221\u2013233 (2011)","DOI":"10.1145\/2034574.2034805"},{"issue":"3-4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF01019463","volume":"6","author":"R. Harper","year":"1993","unstructured":"Harper, R., Lillibridge, M.: Polymorphic type assignment and cps conversion. Lisp and Symbolic Computation\u00a06(3-4), 361\u2013380 (1993)","journal-title":"Lisp and Symbolic Computation"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1017\/S0956796897002748","volume":"7","author":"J. Hatcliff","year":"1997","unstructured":"Hatcliff, J., Danvy, O.: Thunks and the lambda-calculus. J. Funct. Program.\u00a07(3), 303\u2013319 (1997)","journal-title":"J. Funct. Program."},{"issue":"1-2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0304-3975(99)00039-0","volume":"221","author":"K. Honda","year":"1999","unstructured":"Honda, K., Yoshida, N.: Game-theoretic analysis of call-by-value computation. Theor. Comput. Sci.\u00a0221(1-2), 393\u2013456 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"119","author":"A. Joyal","year":"1996","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc. Cambridge Philos. Soc.\u00a0119(3), 447\u2013468 (1996)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"1-2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.tcs.2004.10.022","volume":"333","author":"J. Laird","year":"2005","unstructured":"Laird, J.: Game semantics and linear cps interpretation. Theor. Comput. Sci.\u00a0333(1-2), 199\u2013224 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Melli\u00e8s, P.A.: Game semantics in string diagrams. In: LICS, pp. 481\u2013490. IEEE (2012)","DOI":"10.1109\/LICS.2012.58"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Melli\u00e8s, P.A., Tabareau, N.: Resource modalities in game semantics. In: LICS, pp. 389\u2013398 (2007)","DOI":"10.1109\/LICS.2007.41"},{"issue":"2","key":"23_CR19","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.: Call-by-name, call-by-value and the lambda-calculus. Theor. Comput. Sci.\u00a01(2), 125\u2013159 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BFb0037118","volume-title":"Typed Lambda Calculi and Applications","author":"G.D. Plotkin","year":"1993","unstructured":"Plotkin, G.D., Abadi, M.: A logic for parametric polymorphism. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 361\u2013375. Springer, Heidelberg (1993)"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Sch\u00f6pp, U.: Stratified bounded affine logic for logarithmic space. In: LICS, pp. 411\u2013420 (2007)","DOI":"10.1109\/LICS.2007.45"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-25318-8_23","volume-title":"Programming Languages and Systems","author":"U. Sch\u00f6pp","year":"2011","unstructured":"Sch\u00f6pp, U.: Computation-by-interaction with effects. In: Yang, H. (ed.) APLAS 2011. LNCS, vol.\u00a07078, pp. 305\u2013321. Springer, Heidelberg (2011)"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-38946-7_16","volume-title":"Typed Lambda Calculi and Applications","author":"U. Sch\u00f6pp","year":"2013","unstructured":"Sch\u00f6pp, U.: On interaction, continuations and defunctionalization. In: Hasegawa, M. (ed.) TLCA 2013. LNCS, vol.\u00a07941, pp. 205\u2013220. Springer, Heidelberg (2013)"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Sch\u00f6pp, U.: Organising low-level programs using higher types. In: PPDP 2014 (to appear, 2014)","DOI":"10.1145\/2643135.2643151"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Selinger, P.: A survey of graphical languages for monoidal categories. In: New Structures for Physics. Lecture Notes in Physics, vol.\u00a0813, pp. 289\u2013355. Springer (2011)","DOI":"10.1007\/978-3-642-12821-9_4"},{"issue":"1","key":"23_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/345099.345125","volume":"22","author":"Z. Shao","year":"2000","unstructured":"Shao, Z., Appel, A.W.: Efficient and safe-for-space closure conversion. ACM Trans. Program. Lang. Syst.\u00a022(1), 129\u2013161 (2000)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Theorems for free! In: FPCA, pp. 347\u2013359 (1989)","DOI":"10.1145\/99370.99404"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12736-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T03:55:25Z","timestamp":1559015725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12736-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319127354","9783319127361"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12736-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}