{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:25:11Z","timestamp":1725564311232},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205364"},{"type":"electronic","value":"9783540400189"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40018-9_27","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:03:20Z","timestamp":1283727800000},"page":"410-426","source":"Crossref","is-referenced-by-count":2,"title":["Lazy Stack Copying and Stack Copy Sharing for the Efficient Implementation of Continuations"],"prefix":"10.1007","author":[{"given":"Tomoharu","family":"Ugawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuhisa","family":"Minagawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuneyasu","family":"Komiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Yasugi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taiichi","family":"Yuasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"IEEE-1178-1990: IEEE Standard for the Scheme Programming Language. IEEE (1991)","key":"27_CR1"},{"unstructured":"Revised5 Report on the Algorithmic Language Scheme. In: Kelsey, R., Clinger, W., Rees, J. (eds.) Higher-Order and Symbolic Computation, vol.\u00a011, Kluwer Academic Publishers, Dordrecht (1998)","key":"27_CR2"},{"key":"27_CR3","first-page":"7","volume-title":"Higher-Order and Symbolic Computation","author":"W.D. Clinger","year":"1999","unstructured":"Clinger, W.D., Hartheimer, A.H., Ost, E.M.: Implementation strategies for firstclass continuations. In: Higher-Order and Symbolic Computation, vol.\u00a012, pp. 7\u201345. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"27_CR4","volume-title":"Garbage Collection","author":"R. Jones","year":"1996","unstructured":"Jones, R., Lins, R.: Garbage Collection. John Wiley & Sons, Chichester (1996)"},{"unstructured":"Yuasa, T., Nakagawa, Y., Komiya, T., Yasugi, M.: Return barrier. In: Proceedings International Lisp Conference, San Francisco (2002) (to appear)","key":"27_CR5"},{"unstructured":"Ugawa, T., Komiya, T., Yasugi, M., Yuasa, T.: Lazy stack copying for efficient implementation of continuations. In: Nineteenth Conference Proceedings Japan Society for Software Science and Technology, Japan Society for Software Science and Technology (2002) (in Japanese)","key":"27_CR6"},{"unstructured":"Jaffer, A.: SCM Manual (2003)","key":"27_CR7"},{"key":"27_CR8","first-page":"1","volume-title":"Third Int\u2019l Symp. on Prog. Lang. Implementation and Logic Programming","author":"A.W. Appel","year":"1991","unstructured":"Appel, A.W., MacQueen, D.B.: Standard ML of New Jersey. In: Wirsing, M. (ed.) Third Int\u2019l Symp. on Prog. Lang. Implementation and Logic Programming, pp. 1\u201313. Springer, New York (1991)"},{"key":"27_CR9","volume-title":"Compiling with Continuations","author":"A.W. Appel","year":"1992","unstructured":"Appel, A.W.: Compiling with Continuations. Cambridge University Press, Cambridge (1992)"},{"unstructured":"Flatt, M.: PLT MzScheme: Langurage manual (2000)","key":"27_CR10"},{"key":"27_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5298.001.0001","volume-title":"Performance and Evaluation of Lisp Systems","author":"R. Gabriel","year":"1985","unstructured":"Gabriel, R.: Performance and Evaluation of Lisp Systems. MIT Press, Cambridge (1985)"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/130854.130858","volume":"27","author":"H.G. Baker","year":"1992","unstructured":"Baker, H.G.: CONS should not CONS its arguments, or, a lazy alloc is a smart alloc. ACM SIGPLAN Notices\u00a027, 24\u201334 (1992)","journal-title":"ACM SIGPLAN Notices"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01018614","volume":"7","author":"R.A. Kelsey","year":"1994","unstructured":"Kelsey, R.A., Rees, J.A.: A tractable Scheme implementation. Lisp and Symbolic Computation\u00a07, 315\u2013335 (1994)","journal-title":"Lisp and Symbolic Computation"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/182409.156786","volume-title":"Proceedings 1994 ACM Conference on Lisp and Functional Programming","author":"W.D. Clinger","year":"1994","unstructured":"Clinger, W.D., Hansen, L.T.: Lambda, the ultimate label or a simple optimizing compiler for scheme. In: Proceedings 1994 ACM Conference on Lisp and Functional Programming, pp. 128\u2013139. ACM Press, New York (1994)"},{"doi-asserted-by":"crossref","unstructured":"Samples, A.D., Ungar, D., Hilfinger, P.: SOAR: Smalltalk without bytecodes. In: Proceedings OOPSLA 1986. ACM SIGPLAN Notices, vol.\u00a021, pp. 107\u2013118 (1986)","key":"27_CR15","DOI":"10.1145\/960112.28708"},{"key":"27_CR16","volume-title":"Smalltalk-80: The Language and Its Implementation","author":"A. Goldberg","year":"1983","unstructured":"Goldberg, A., Robson, D.: Smalltalk-80: The Language and Its Implementation. Addison-Wesley, Reading (1983)"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF01932156","volume":"17","author":"D.P. Friedman","year":"1977","unstructured":"Friedman, D.P., Wise, D.S.: The one-bit reference count. BIT\u00a017, 351\u2013359 (1977)","journal-title":"BIT"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/91556.91631","volume-title":"Proceedings of the 1990 ACM conference on LISP and functional programming","author":"E. Mohr","year":"1990","unstructured":"Mohr, E., Kranz, D.A., Halstead, J. R.H.: Lazy task creation: a technique for increasing the granularity of parallel programs. In: Proceedings of the 1990 ACM conference on LISP and functional programming, pp. 185\u2013197. ACM Press, New York (1990)"},{"doi-asserted-by":"crossref","unstructured":"Goldstein, S.C., Schauser, K.E., Culler, D.E.: Enabling Primitives for Compiling Parallel Languages. In: Third Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers (1995)","key":"27_CR19","DOI":"10.1007\/978-1-4615-2315-4_12"},{"doi-asserted-by":"crossref","unstructured":"Taura, K., Yonezawa, A.: Fine-grain multithreading with minimal compiler support - a cost effective approach to implementing efficient multithreading languages. In: SIGPLAN Conference on Programming Language Design and Implementation, pp. 320\u2013333 (1997)","key":"27_CR20","DOI":"10.1145\/258915.258944"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BFb0055434","volume-title":"Implementation of Functional Languages","author":"M.M.T. Chakravarty","year":"1998","unstructured":"Chakravarty, M.M.T.: Lazy thread and task creation in parallel graph reduction. In: Clack, C., Hammond, K., Davie, T. (eds.) IFL 1997. LNCS, vol.\u00a01467, p. 231. Springer, Heidelberg (1998)"}],"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-540-40018-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T21:16:39Z","timestamp":1559596599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40018-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205364","9783540400189"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40018-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}