乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:31:34Z","timestamp":1725744694955},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603163","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Substitution, jumps, and algebraic effects"],"prefix":"10.1145","author":[{"given":"Marcelo","family":"Fiore","sequence":"first","affiliation":[{"name":"University of Cambridge"}]},{"given":"Sam","family":"Staton","sequence":"additional","affiliation":[{"name":"ICIS, Radboud University Nijmegen"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75303"},{"volume-title":"Programming with algebraic effects and handlers. arXiv:1203.1539","year":"2012","author":"Bauer A.","key":"e_1_3_2_1_2_1","unstructured":"A. Bauer and M. Pretnar . Programming with algebraic effects and handlers. arXiv:1203.1539 , 2012 . A. Bauer and M. Pretnar. Programming with algebraic effects and handlers. arXiv:1203.1539, 2012."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004099"},{"key":"e_1_3_2_1_4_1","first-page":"216","article-title":"Monads with arities and their associated theories","author":"Berger C.","year":"2012","unstructured":"C. Berger , P.-A. Melli\u00e8s , and M. Weber . Monads with arities and their associated theories . J. Pure Appl. Algebra , 216 , 2012 . C. Berger, P.-A. Melli\u00e8s, and M. Weber. Monads with arities and their associated theories. J. Pure Appl. Algebra, 216, 2012.","journal-title":"J. Pure Appl. Algebra"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500581"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/645892.671443"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/99583.99608"},{"key":"e_1_3_2_1_8_1","first-page":"193","volume-title":"Formal Description of Programming Concepts","author":"Felleisen M.","year":"1986","unstructured":"M. Felleisen and D. P. Friedman . Control operators, the SECD-machine, and the \u03bb-calculus . In Formal Description of Programming Concepts , pages 193 -- 217 . North Holland , 1986 . M. Felleisen and D. P. Friedman. Control operators, the SECD-machine, and the \u03bb-calculus. In Formal Description of Programming Concepts, pages 193--217. North Holland, 1986."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.178047"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.027"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31982-5_2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.38"},{"key":"e_1_3_2_1_13_1","first-page":"320","volume-title":"CSL 2010","author":"Fiore M. P.","year":"2010","unstructured":"M. P. Fiore and C.-K. Hur . Second-order equational logic . In CSL 2010 , pages 320 -- 335 , 2010 . M. P. Fiore and C.-K. Hur. Second-order equational logic. In CSL 2010, pages 320--335, 2010."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885577.1885610"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/788021.788948"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-007-0056-1"},{"key":"e_1_3_2_1_17_1","first-page":"23","volume-title":"Proc. UTP 2012","author":"Gibbons J.","year":"2012","unstructured":"J. Gibbons . Unifying theories of programming with monads . In Proc. UTP 2012 , pages 23 -- 67 , 2012 . J. Gibbons. Unifying theories of programming with monads. In Proc. UTP 2012, pages 23--67, 2012."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224173"},{"key":"e_1_3_2_1_19_1","first-page":"348","volume-title":"APLAS 2004","author":"Hamana M.","year":"2004","unstructured":"M. Hamana . Free \u03a3-monoids : A higher-order syntax with metavariables . In APLAS 2004 , pages 348 -- 363 , 2004 . M. Hamana. Free \u03a3-monoids: A higher-order syntax with metavariables. In APLAS 2004, pages 348--363, 2004."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2431407"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.49"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.07.003"},{"volume-title":"Math. Struct. Comput. Sci.","year":"2014","author":"Hyland J. M. E.","key":"e_1_3_2_1_23_1","unstructured":"J. M. E. Hyland . Classical lambda calculus in modern dress . Math. Struct. Comput. Sci. , 2014 . To appear. J. M. E. Hyland. Classical lambda calculus in modern dress. Math. Struct. Comput. Sci., 2014. To appear."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103698"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500590"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(93)90092-8"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503778.2503791"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(99)00019-5"},{"volume-title":"A functional\/imperative synthesis","year":"2004","author":"Levy P. B.","key":"e_1_3_2_1_29_1","unstructured":"P. B. Levy . Call-by-push-value. A functional\/imperative synthesis . Springer , 2004 . P. B. Levy. Call-by-push-value. A functional\/imperative synthesis. Springer, 2004."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00088-9"},{"volume-title":"The Frank manual. tinyurl.com\/frank-manual","year":"2012","author":"McBride C.","key":"e_1_3_2_1_31_1","unstructured":"C. McBride . The Frank manual. tinyurl.com\/frank-manual , 2012 . C. McBride. The Frank manual. tinyurl.com\/frank-manual, 2012."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.46"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22944-2_21"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/646793.704708"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/646794.704856"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023064908962"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_7"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.02.024"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591370.2591394"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37075-5_26"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8750-x"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70594-9_20"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/601775.601776"}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T19:07:32Z","timestamp":1673204852000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":44,"alternative-id":["10.1145\/2603088.2603163","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603163","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}