{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:54Z","timestamp":1725569994105},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642171635"},{"type":"electronic","value":"9783642171642"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17164-2_6","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T05:54:39Z","timestamp":1290146079000},"page":"63-79","source":"Crossref","is-referenced-by-count":5,"title":["Towards Deriving Type Systems and Implementations for Coroutines"],"prefix":"10.1007","author":[{"given":"Konrad","family":"Anton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Thiemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Anton, K., Thiemann, P.: Typing coroutines. In: Page, R., Zs\u00f3k, V., Horv\u00e1th, Z. (eds.) Eleventh Symposium on Trends in Functional Programming (draft proceedings), pp. 91\u2013105. University of Oklahoma Printing Services (2010)","key":"6_CR1"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-76637-7_16","volume-title":"Programming Languages and Systems","author":"K. Asai","year":"2007","unstructured":"Asai, K., Kameyama, Y.: Polymorphic delimited continuations. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol.\u00a04807, pp. 239\u2013254. Springer, Heidelberg (2007)"},{"unstructured":"Blazevic, M.: monad-coroutine: Coroutine monad transformer for suspending and resuming monadic computations (2010), http:\/\/hackage.haskell.org\/package\/monad-coroutine","key":"6_CR3"},{"issue":"5","key":"6_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1017\/S0956796809007205","volume":"19","author":"J. Carette","year":"2009","unstructured":"Carette, J., Kiselyov, O., Chieh Shan, C.: Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages. J. Funct. Program.\u00a019(5), 509\u2013543 (2009)","journal-title":"J. Funct. Program."},{"issue":"7","key":"6_CR5","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1145\/366663.366704","volume":"6","author":"M.E. Conway","year":"1963","unstructured":"Conway, M.E.: Design of a separable transition-diagram compiler. ACM Comm.\u00a06(7), 396\u2013408 (1963)","journal-title":"ACM Comm."},{"doi-asserted-by":"crossref","unstructured":"Danvy, O.: Defunctionalized interpreters for programming languages, pp. 131\u2013142 (2008)","key":"6_CR6","DOI":"10.1145\/1411203.1411206"},{"unstructured":"Danvy, O., Filinski, A.: A functional abstraction of typed contexts. Technical Report 89\/12, DIKU, University of Copenhagen (July 1989)","key":"6_CR7"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/91556.91622","volume-title":"Proc. 1990 ACM Conference on Lisp and Functional Programming","author":"O. Danvy","year":"1990","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: Proc. 1990 ACM Conference on Lisp and Functional Programming, Nice, France, pp. 151\u2013160. ACM Press, New York (1990)"},{"issue":"8","key":"6_CR9","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.scico.2007.10.007","volume":"74","author":"O. Danvy","year":"2009","unstructured":"Danvy, O., Millikin, K.: Refunctionalization at work. Science of Computer Programming\u00a074(8), 534\u2013549 (2009)","journal-title":"Science of Computer Programming"},{"doi-asserted-by":"crossref","unstructured":"Danvy, O., Nielsen, L.R.: Refocusing in reduction semantics. Research Report BRICS RS-04-26, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark (November 2004)","key":"6_CR10","DOI":"10.7146\/brics.v11i26.21851"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462166.1462167","volume":"31","author":"A.L. Moura de","year":"2009","unstructured":"de Moura, A.L., Ierusalimschy, R.: Revisiting coroutines. ACM Trans. Program. Lang. Syst.\u00a031(2), 1\u201331 (2009)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR12","first-page":"925","volume":"10","author":"A.L. Moura de","year":"2004","unstructured":"de Moura, A.L., Rodriguez, N., Ierusalimschy, R.: Coroutines in Lua. Journal of Universal Computer Science\u00a010, 925 (2004)","journal-title":"Journal of Universal Computer Science"},{"unstructured":"Friedman, D.P., Wand, M.: Essentials of Programming Languages, 3rd edn. MIT Press, McGraw-Hill (2008)","key":"6_CR13"},{"doi-asserted-by":"crossref","unstructured":"Haynes, C.T., Friedman, D.P., Wand, M.: Continuations and coroutines. In: ACM Conference on Lisp and Functional Programming, pp. 293\u2013298 (1984)","key":"6_CR14","DOI":"10.1145\/800055.802046"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-642-12251-4_22","volume-title":"Functional and Logic Programming","author":"O. Kiselyov","year":"2010","unstructured":"Kiselyov, O.: Delimited control in OCaml, abstractly and concretely: System description. In: Blume, M., Kobayashi, N., Vidal, G. (eds.) FLOPS 2010. LNCS, vol.\u00a06009, pp. 304\u2013320. Springer, Heidelberg (2010)"},{"key":"6_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10256-6","volume-title":"Coroutines: a programming methodology, a language design and an implementation","author":"C.D. Marlin","year":"1980","unstructured":"Marlin, C.D.: Coroutines: a programming methodology, a language design and an implementation. Springer, Heidelberg (1980)"},{"unstructured":"Microsoft Corp. C# Version 2.0 Specification (2005), http:\/\/msdn.microsoft.com\/en-US\/library\/618ayhy6v=VS.80.aspx","key":"6_CR17"},{"key":"6_CR18","volume-title":"Types and Programming Languages","author":"B.C. Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"issue":"5","key":"6_CR19","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1017\/S0956796899003469","volume":"9","author":"P. Thiemann","year":"1999","unstructured":"Thiemann, P.: Combinators for program generation. J. Funct. Program.\u00a09(5), 483\u2013525 (1999)","journal-title":"J. Funct. Program."},{"unstructured":"Van Rossum, G., Eby, P.: PEP 342 \u2013 coroutines via enhanced generators (2005), http:\/\/www.python.org\/dev\/peps\/pep-0342\/","key":"6_CR20"},{"key":"6_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96717-7","volume-title":"Programming in Modula-2","author":"N. Wirth","year":"1982","unstructured":"Wirth, N.: Programming in Modula-2. Springer, Heidelberg (1982)"}],"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-642-17164-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T07:18:14Z","timestamp":1559805494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17164-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171635","9783642171642"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17164-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}