{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:10Z","timestamp":1772163970029,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,9,16]]},"DOI":"10.1145\/1159803.1159808","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T18:04:00Z","timestamp":1161194640000},"page":"26-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Delimited dynamic binding"],"prefix":"10.1145","author":[{"given":"Oleg","family":"Kiselyov","sequence":"first","affiliation":[{"name":"FNMOC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-chieh","family":"Shan","sequence":"additional","affiliation":[{"name":"Rutgers University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amr","family":"Sabry","sequence":"additional","affiliation":[{"name":"Indiana University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,9,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1016850.1016860"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359566"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/122598.122614"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645435.652655"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964007"},{"key":"e_1_3_2_1_6_1","volume-title":"Artificial Intelligence Laboratory","author":"Bawden A.","year":"1988","unstructured":"Bawden , A. Reification without evaluation. Memo 946 , Artificial Intelligence Laboratory , Massachusetts Institute of Technology , 1 June 1988 . Bawden, A. Reification without evaluation. Memo 946, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 1 June 1988."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-1(2:5)2005"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25938-1_13"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/645868.668496"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765712.1765717"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040307"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237784"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91622"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500001535"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/62678.62725"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647424.725801"},{"key":"e_1_3_2_1_19_1","unstructured":"Feeley M. Parameter objects. Scheme Request for Implementation SRFI-39. http:\/\/srfi.schemers.org\/srfi-39\/ 2003.  Feeley M. Parameter objects. Scheme Request for Implementation SRFI-39. http:\/\/srfi.schemers.org\/srfi-39\/ 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73576"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(91)90036-W"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.178047"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292557"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications (May 2001","author":"Filinski A.","year":"2044","unstructured":"Filinski , A. Normalization by evaluation for the computational lambda-calculus . In Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications (May 2001 ), S. Abramsky, Ed., no. 2044 in Lecture Notes in Computer Science, Springer-Verlag, pp. 151--165. Filinski, A. Normalization by evaluation for the computational lambda-calculus. In Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications (May 2001), S. Abramsky, Ed., no. 2044 in Lecture Notes in Computer Science, Springer-Verlag, pp. 151--165."},{"key":"e_1_3_2_1_27_1","volume-title":"Allegro Common Lisp 8.0","author":"Franz Inc.","year":"2006","unstructured":"Franz Inc. Allegro Common Lisp 8.0 , 17 Mar. 2006 . Franz Inc. Allegro Common Lisp 8.0, 17 Mar. 2006."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/318593.318654"},{"key":"e_1_3_2_1_29_1","first-page":"30","volume-title":"Proceedings of the 4th Workshop on Scheme and Functional Programming (7","author":"Gasbichler M.","year":"2003","unstructured":"Gasbichler , M. , Knauel , E. , Sperber , M. , and Kelsey , R. A . How to add threads to a sequential language without getting tangled up . In Proceedings of the 4th Workshop on Scheme and Functional Programming (7 Nov. 2003 ), M. Flatt, Ed., no. UUCS-03-023 in Tech. Rep., School of Computing, University of Utah , pp. 30 -- 47 . Gasbichler, M., Knauel, E., Sperber, M., and Kelsey, R. A. How to add threads to a sequential language without getting tangled up. In Proceedings of the 4th Workshop on Scheme and Functional Programming (7 Nov. 2003), M. Flatt, Ed., no. UUCS-03-023 in Tech. Rep., School of Computing, University of Utah, pp. 30--47."},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the 3rd Workshop on Scheme and Functional Programming (3","author":"Gasbichler M.","year":"2002","unstructured":"Gasbichler , M. , and Sperber , M . Processes vs. user-level threads in Scsh . In Proceedings of the 3rd Workshop on Scheme and Functional Programming (3 Oct. 2002 ). Gasbichler, M., and Sperber, M. Processes vs. user-level threads in Scsh. In Proceedings of the 3rd Workshop on Scheme and Functional Programming (3 Oct. 2002)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/236337.236358"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012992731199"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224173"},{"key":"e_1_3_2_1_35_1","unstructured":"Gunter C. A. R\u00c9my D. and Riecke J. G. Return types for functional continuations. http:\/\/pauillac.inria.fr\/~remy\/work\/cupto\/ Sept. 1998.  Gunter C. A. R\u00c9my D. and Riecke J. G. Return types for functional continuations. http:\/\/pauillac.inria.fr\/~remy\/work\/cupto\/ Sept. 1998."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/29873.30392"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944722"},{"key":"e_1_3_2_1_38_1","unstructured":"Kiselyov O. General ways to traverse collections. http:\/\/okmij.org\/ftp\/Scheme\/enumerators-callcc.html;http:\/\/okmij. org\/ftp\/Computation\/Continuations.html 1Jan.2004.  Kiselyov O. General ways to traverse collections. http:\/\/okmij.org\/ftp\/Scheme\/enumerators-callcc.html;http:\/\/okmij. org\/ftp\/Computation\/Continuations.html 1Jan.2004."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086390"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/182409.182483"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/349214.349230"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199528"},{"key":"e_1_3_2_1_43_1","unstructured":"Matthews J. I learned today that PLT Scheme actually has two kinds of thread-local storage boxes. http:\/\/keepworkingworkerbee.blogspot.com\/2005\/08\/i-learned-today-that-plt-scheme.html 26Aug.2005.  Matthews J. I learned today that PLT Scheme actually has two kinds of thread-local storage boxes. http:\/\/keepworkingworkerbee.blogspot.com\/2005\/08\/i-learned-today-that-plt-scheme.html 26Aug.2005."},{"key":"e_1_3_2_1_44_1","first-page":"41","volume-title":"Proceedings of the 6th Workshop on Scheme and Functional Programming (24","author":"Matthews J.","year":"2005","unstructured":"Matthews , J. , and Findler , R. B . An operational semantics for R5RS Scheme . In Proceedings of the 6th Workshop on Scheme and Functional Programming (24 Sept. 2005 ), J.M. Ashley and M. Sperber, Eds., no. 619 in Tech. Rep., Computer Science Department, Indiana University , pp. 41 -- 54 . Matthews, J., and Findler, R. B. An operational semantics for R5RS Scheme. In Proceedings of the 6th Workshop on Scheme and Functional Programming (24 Sept. 2005), J.M. Ashley and M. Sperber, Eds., no. 619 in Tech. Rep., Computer Science Department, Indiana University, pp. 41--54."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010087314987"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-004-4866-z"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086370"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155104"},{"key":"e_1_3_2_1_51_1","first-page":"48","volume-title":"Proceedings of the 4th Workshop on Scheme and Functional Programming (7","author":"Sitaram D.","year":"2003","unstructured":"Sitaram , D. Unwind-protect in portable Scheme . In Proceedings of the 4th Workshop on Scheme and Functional Programming (7 Nov. 2003 ), M. Flatt, Ed., no. UUCS-03-023 in Tech. Rep., School of Computing, University of Utah , pp. 48 -- 52 . Sitaram, D. Unwind-protect in portable Scheme. In Proceedings of the 4th Workshop on Scheme and Functional Programming (7 Nov. 2003), M. Flatt, Ed., no. UUCS-03-023 in Tech. Rep., School of Computing, University of Utah, pp. 48--52."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91626"},{"key":"e_1_3_2_1_54_1","first-page":"61","volume-title":"Proceedings of the Workshop on Scheme and Functional Programming (Sept.","author":"Sumii E.","year":"2000","unstructured":"Sumii , E. An implementation of transparent migration on standard Scheme . In Proceedings of the Workshop on Scheme and Functional Programming (Sept. 2000 ), M. Felleisen, Ed., no. 00-368 in Tech. Rep., Department of Computer Science, Rice University , pp. 61 -- 63 . Sumii, E. An implementation of transparent migration on standard Scheme. In Proceedings of the Workshop on Scheme and Functional Programming (Sept. 2000), M. Felleisen, Ed., no. 00-368 in Tech. Rep., Department of Computer Science, Rice University, pp. 61--63."},{"key":"e_1_3_2_1_55_1","unstructured":"Thielecke H. Contrasting exceptions and continuations. http:\/\/www. cs. bham. ac. uk\/~hxt\/research\/exncontjournal. pdf 2001.  Thielecke H. Contrasting exceptions and continuations. http:\/\/www. cs. bham. ac. uk\/~hxt\/research\/exncontjournal. pdf 2001."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003469"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01806174"}],"event":{"name":"ICFP06: ACM SIGPLAN International Conference on Functional Programming","location":"Portland Oregon USA","acronym":"ICFP06","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1159803.1159808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T16:04:36Z","timestamp":1693843476000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1159803.1159808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,16]]},"references-count":49,"alternative-id":["10.1145\/1159803.1159808","10.1145\/1159803"],"URL":"https:\/\/doi.org\/10.1145\/1159803.1159808","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1160074.1159808","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2006,9,16]]},"assertion":[{"value":"2006-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}