乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T15:58:15Z","timestamp":1725724695657},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,1,21]]},"DOI":"10.1145\/1480881.1480903","type":"proceedings-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T09:41:38Z","timestamp":1232444498000},"page":"153-164","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Lazy evaluation and delimited control"],"prefix":"10.1145","author":[{"given":"Ronald","family":"Garcia","sequence":"first","affiliation":[{"name":"Rice University, Houston, TX, USA"}]},{"given":"Andrew","family":"Lumsdaine","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]},{"given":"Amr","family":"Sabry","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,1,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000186"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002724"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199507"},{"key":"e_1_3_2_1_4_1","volume-title":"The Lambda Calculus, its Syntax and Semantics. North-Holland","author":"Barendregt Henk P.","year":"1981","unstructured":"Henk P. Barendregt . The Lambda Calculus, its Syntax and Semantics. North-Holland , Amsterdam, NL , 1981 . Studies in Logic and the Foundations of Mathematics . Henk P. Barendregt. The Lambda Calculus, its Syntax and Semantics. North-Holland, Amsterdam, NL, 1981. Studies in Logic and the Foundations of Mathematics."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297658.1297664"},{"key":"e_1_3_2_1_6_1","volume-title":"North-Holland","author":"Curry Haskell Brookes","year":"1958","unstructured":"Haskell Brookes Curry and Robert Feys . Combinatory Logic , Volume I. Studies in Logic and the Foundations of Mathematics . North-Holland , Amsterdam , 1958 . Second printing 1968. Haskell Brookes Curry and Robert Feys. Combinatory Logic, Volume I. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1958. Second printing 1968."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91622"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006259"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73576"},{"key":"e_1_3_2_1_11_1","volume-title":"January","author":"Felleisen Matthias","year":"2002","unstructured":"Matthias Felleisen and Matthew Flatt . Programming languages and lambda calculi. Available from http:\/\/www.cs.utah.edu\/plt\/publications\/pllc.pdf , January 2002 . Matthias Felleisen and Matthew Flatt. Programming languages and lambda calculi. Available from http:\/\/www.cs.utah.edu\/plt\/publications\/pllc.pdf, January 2002."},{"key":"e_1_3_2_1_12_1","first-page":"193","volume-title":"Formal Description of Programming Concepts","author":"Felleisen Matthias","year":"1986","unstructured":"Matthias Felleisen and Daniel P. Friedman . Control operators, the SECD-machine, and the \u03bb-calculus. In M. Wirsing, editor , Formal Description of Programming Concepts , pages 193 -- 217 . North-Holland , 1986 . Matthias Felleisen and Daniel P. Friedman. Control operators, the SECD-machine, and the \u03bb-calculus. In M. Wirsing, editor, Formal Description of Programming Concepts, pages 193--217. North-Holland, 1986."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90014-7"},{"key":"e_1_3_2_1_14_1","first-page":"257","volume-title":"CONS should not evaluate its arguments","author":"Friedman Daniel P.","year":"1976","unstructured":"Daniel P. Friedman and David S. Wise . CONS should not evaluate its arguments . In S. Michaelson and Robin Milner, editors, Automata, Languages and Programming, pages 257 -- 284 , Edinburgh, Scotland, 1976 . Edinburgh University Press . Daniel P. Friedman and David S. Wise. CONS should not evaluate its arguments. In S. Michaelson and Robin Milner, editors, Automata, Languages and Programming, pages 257--284, Edinburgh, Scotland, 1976. Edinburgh University Press."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9014-0"},{"key":"e_1_3_2_1_16_1","first-page":"11","volume-title":"Proceedings of Conference on Computing: The Australian Theory Symposium","author":"Gibbons Jeremy","year":"1996","unstructured":"Jeremy Gibbons and Keith Wansbrough . Tracing lazy functional languages. In Michael E. Houle and Peter Eades, editors , Proceedings of Conference on Computing: The Australian Theory Symposium , pages 11 -- 20 , Townsville , January 29-30 1996 . Australian Computer Science Communications. ISBN ISSN 0157-3055. Jeremy Gibbons and Keith Wansbrough. Tracing lazy functional languages. In Michael E. Houle and Peter Eades, editors, Proceedings of Conference on Computing: The Australian Theory Symposium, pages 11--20, Townsville, January 29-30 1996. Australian Computer Science Communications. ISBN ISSN 0157-3055."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/800168.811543"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328408.1328430"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086390"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159803.1159808"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9018-9"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003037"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2004018"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01019945"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99385"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002712"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-007-9010-4"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010035624696"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1016850.1016861"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90112-B"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/646452.692938"}],"event":{"name":"POPL09: The 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Savannah GA USA","acronym":"POPL09"},"container-title":["Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1480881.1480903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T17:20:15Z","timestamp":1693848015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1480881.1480903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,21]]},"references-count":32,"alternative-id":["10.1145\/1480881.1480903","10.1145\/1480881"],"URL":"https:\/\/doi.org\/10.1145\/1480881.1480903","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1594834.1480903","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009,1,21]]},"assertion":[{"value":"2009-01-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}