{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:25Z","timestamp":1751983645764},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055940X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017193","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:37:21Z","timestamp":1132627041000},"page":"230-247","source":"Crossref","is-referenced-by-count":3,"title":["An efficient implementation for coroutines"],"prefix":"10.1007","author":[{"given":"Luis","family":"Mateu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(87)90175-X","volume":"25","author":"A. W. Appel","year":"1987","unstructured":"Andrew W. Appel: \u201cGarbage Collection Can Be Faster Than Stack Allocation,\u201d Information Processing Letters 25, 1987, 275\u2013279.","journal-title":"Information Processing Letters"},{"issue":"2","key":"12_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/spe.4380190206","volume":"19","author":"A. W. Appel","year":"1989","unstructured":"Andrew W. Appel: \u201cSimple Generational Garbage Collection and Fast Allocation\u201d, Software-Practice and Experience, 19(2), February 1989, 171\u2013183.","journal-title":"Software-Practice and Experience"},{"issue":"10","key":"12_CR3","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/362375.362379","volume":"16","author":"D. G. Bobrow","year":"1973","unstructured":"Daniel G. Bobrow and Ben Wegbreit: \u201cA Model and Stack Implementation of Multiple Environments,\u201d Communications of the ACM, 16(10), October 1973, 591\u2013603.","journal-title":"Communications of the ACM"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"William D. Clinger, Anne H. Hartheimer and Eric M. Ost: \u201cImplementation Strategies for Continuations,\u201d Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, July 1988, 124\u2013131.","DOI":"10.1145\/62678.62692"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Richard P. Gabriel: Performance and Evaluation of Lisp Systems, the MIT Press, 1985.","DOI":"10.7551\/mitpress\/5298.001.0001"},{"issue":"3\/4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0096-0551(86)90007-X","volume":"11","author":"C. T. Haynes","year":"1986","unstructured":"Christopher T. Haynes, Daniel P. Friedman and Mitchell Wand: \u201cObtaining Coroutines with Continuations\u201d, Computer Languages, 11(3\/4), 1986, 143\u2013153.","journal-title":"Computer Languages"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Robert Hieb, R. Kent Dybvig and Carl Bruggeman: \u201cRepresenting Control in Presence of First-Class Continuations,\u201d Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation, White Plains, New York, June 20\u201322, 1990, 66\u201377.","DOI":"10.1145\/93542.93554"},{"issue":"6","key":"12_CR8","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/358141.358147","volume":"26","author":"H. Lieberman","year":"1983","unstructured":"Henry Lieberman and Carl Hewitt: \u201cA Real-Time Garbage Collector Based on the Lifetimes of Objects,\u201d Communications of the ACM, 26(6), June 1983, 419\u2013429.","journal-title":"Communications of the ACM"},{"key":"12_CR9","unstructured":"Katsuto Nakajima: \u201cPiling GC \u2014 Efficient Garbage Collection for AI Languages \u2014,\u201d Parallel Processing, M. Cosnard, M. H. Barton and M. Vanneschi (Editors), Elsevier Science Publishers B.V. (North Holland), IFIP, 1988, 201\u2013204."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Jonathan A. Rees and William Clinger, eds.: \u201cThe Revised3 Report on the Algorithmic Language Scheme,\u201d SIGPLAN Notices, 21(12), December 1986.","DOI":"10.1145\/15042.15043"},{"key":"12_CR11","unstructured":"Nitsan S\u00e9niak: Th\u00e9orie et pratique de Sqil, un langage interm\u00e9diaire pour la compilation des langages fonctionnels, Th\u00e8se de Doctorat de l'Universit\u00e9 Paris 6, October 1991."}],"container-title":["Lecture Notes in Computer Science","Memory Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0017193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T22:55:36Z","timestamp":1586559336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055940X"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0017193","relation":{},"subject":[]}}