{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:47Z","timestamp":1750306787810,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T00:00:00Z","timestamp":1379289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["NGN-44"],"award-info":[{"award-number":["NGN-44"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,16]]},"DOI":"10.1145\/2505879.2505899","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T19:57:05Z","timestamp":1379447825000},"page":"109-119","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A logical correspondence between natural semantics and abstract machines"],"prefix":"10.1145","author":[{"given":"Robert J.","family":"Simmons","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Ian","family":"Zerny","sequence":"additional","affiliation":[{"name":"Aarhus University"}]}],"member":"320","published-online":{"date-parts":[[2013,9,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11506676_16"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/888251.888254"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.02.012"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.06.008"},{"key":"e_1_3_2_1_5_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-642-22941-1_2","volume-title":"Trends in Functional Programming","author":"Anton K.","year":"2011","unstructured":"K. Anton and P. Thiemann . Typing coroutines . In R. Page, Z. Horvth, and V. Zsk, editors, Trends in Functional Programming , volume 6546 of LNCS , pages 16 -- 30 . Springer Berlin Heidelberg , 2011 . K. Anton and P. Thiemann. Typing coroutines. In R. Page, Z. Horvth, and V. Zsk, editors, Trends in Functional Programming, volume 6546 of LNCS, pages 16--30. Springer Berlin Heidelberg, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29822-6_6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.028"},{"key":"e_1_3_2_1_9_1","first-page":"143","volume-title":"From interpreter to logic engine by defunctionalization","author":"Biernacki D.","year":"2010","unstructured":"D. Biernacki and O. Danvy . From interpreter to logic engine by defunctionalization . In M. Bruynooghe, editor, LOPSTR 2010 , number 3018 in LNCS, pages 143 -- 159 . Springer , Aug. 2003. D. Biernacki and O. Danvy. From interpreter to logic engine by defunctionalization. In M. Bruynooghe, editor, LOPSTR 2010, number 3018 in LNCS, pages 143--159. Springer, Aug. 2003."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00313-3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/143165.143184"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364546"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411206"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1929501.1929503"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.02.023"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/788018.788825"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2627"},{"key":"e_1_3_2_1_22_1","volume-title":"Semantics Engineering with PLT Redex","author":"Felleisen M.","year":"2009","unstructured":"M. Felleisen , R. B. Findler , and M. Flatt . Semantics Engineering with PLT Redex . MIT Press , 2009 . M. Felleisen, R. B. Findler, and M. Flatt. Semantics Engineering with PLT Redex. MIT Press, 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91680"},{"key":"e_1_3_2_1_24_1","volume-title":"Practical foundations for programming languages","author":"Harper R.","year":"2013","unstructured":"R. Harper . Practical foundations for programming languages . Cambridge University Press , 2013 . R. Harper. Practical foundations for programming languages. Cambridge University Press, 2013."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138060"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796807006430"},{"key":"e_1_3_2_1_27_1","first-page":"22","volume-title":"F.-J","author":"Kahn G.","year":"1987","unstructured":"G. Kahn . Natural semantics . In F.-J . Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, Proc. of STACS'87, number 247 in LNCS, pages 22 -- 39 . Springer-Verlag , Feb. 1987 . G. Kahn. Natural semantics. In F.-J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, Proc. of STACS'87, number 247 in LNCS, pages 22--39. Springer-Verlag, Feb. 1987."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1958.11989160"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2007.12.004"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2004.03.008"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_26"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90028-0"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/120477.120483"},{"key":"e_1_3_2_1_34_1","volume-title":"Programming Languages and Systems, page 196","author":"Pfenning F.","year":"2004","unstructured":"F. Pfenning . Substructural operational semantics and linear destination-passing style . In Programming Languages and Systems, page 196 . Springer LNCS 3302, 2004 . Abstract of invited talk. F. Pfenning. Substructural operational semantics and linear destination-passing style. In Programming Languages and Systems, page 196. Springer LNCS 3302, 2004. Abstract of invited talk."},{"key":"e_1_3_2_1_35_1","volume-title":"Feb.","author":"Pfenning F.","year":"2012","unstructured":"F. Pfenning . Lecture notes for 15-816: Linear logic , Feb. 2012 . F. Pfenning. Lecture notes for 15-816: Linear logic, Feb. 2012."},{"key":"e_1_3_2_1_36_1","first-page":"179","volume-title":"Types for Proofs and Programs","author":"Pfenning F.","year":"1998","unstructured":"F. Pfenning and C. Sch\u00fcrmann . Algorithms for equality and unification in the presence of notational definitions . In Types for Proofs and Programs , pages 179 -- 193 , 1998 . F. Pfenning and C. Sch\u00fcrmann. Algorithms for equality and unification in the presence of notational definitions. In Types for Proofs and Programs, pages 179--193, 1998."},{"key":"e_1_3_2_1_37_1","first-page":"202","volume-title":"Proc. of CADE'16","author":"Pfenning F.","year":"1999","unstructured":"F. Pfenning and C. Sch\u00fcrmann . System description: Twelf --- a meta-logical framework for deductive systems . In H. Ganzinger, editor, Proc. of CADE'16 , pages 202 -- 206 . Springer LNAI 1632, 1999 . F. Pfenning and C. Sch\u00fcrmann. System description: Twelf --- a meta-logical framework for deductive systems. In H. Ganzinger, editor, Proc. of CADE'16, pages 202--206. Springer LNAI 1632, 1999."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.8"},{"key":"e_1_3_2_1_39_1","series-title":"ENTCS","first-page":"449","volume-title":"Proc. of MFPS'99","author":"Polakow J.","year":"1999","unstructured":"J. Polakow and F. Pfenning . Relating natural deduction and sequent calculus for intuitionistic non-commutative linear logic . In A. Scedrov and A. Jung, editors, Proc. of MFPS'99 , volume 20 of ENTCS , pages 449 -- 466 , Apr. 1999 . J. Polakow and F. Pfenning. Relating natural deduction and sequent calculus for intuitionistic non-commutative linear logic. In A. Scedrov and A. Jung, editors, Proc. of MFPS'99, volume 20 of ENTCS, pages 449--466, Apr. 1999."},{"key":"e_1_3_2_1_41_1","unstructured":"M. Puech. Certificates for Incremental Type Checking. PhD thesis Alma Mater Studiorum Universit\u00e0 di Bologna and Universit\u00e9 Paris Diderot Paris 7 Apr. 2013.  M. Puech. Certificates for Incremental Type Checking . PhD thesis Alma Mater Studiorum Universit\u00e0 di Bologna and Universit\u00e9 Paris Diderot Paris 7 Apr. 2013."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/800194.805852"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2010.03.012"},{"key":"e_1_3_2_1_44_1","first-page":"37","volume-title":"Proc. of LFMTP'07","author":"Schack-Nielsen A.","year":"2007","unstructured":"A. Schack-Nielsen . Induction on concurrent terms . In Proc. of LFMTP'07 , pages 37 -- 51 , 2007 . A. Schack-Nielsen. Induction on concurrent terms. In Proc. of LFMTP'07, pages 37--51, 2007."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71070-7_28"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.10.008"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-011-9071-2"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863553"},{"key":"e_1_3_2_1_50_1","volume-title":"Carnegie Mellon University","author":"Virga R.","year":"1999","unstructured":"R. Virga . Higher-Order Rewriting with Dependent Types. PhD thesis , Carnegie Mellon University , 1999 . R. Virga. Higher-Order Rewriting with Dependent Types. PhD thesis, Carnegie Mellon University, 1999."},{"key":"e_1_3_2_1_52_1","volume-title":"Aarhus University","author":"Zerny I.","year":"2013","unstructured":"I. Zerny . The interpretation and inter-derivation of small-step and big-step specifications. PhD thesis, Department of Computer Science , Aarhus University , Aarhus, Denmark , 2013 . Forthcoming. I. Zerny. The interpretation and inter-derivation of small-step and big-step specifications. PhD thesis, Department of Computer Science, Aarhus University, Aarhus, Denmark, 2013. Forthcoming."}],"event":{"name":"PPDP '13: 15th International Symposium on Principles and Practice of Declarative Programming","sponsor":["Universidad Complutense de Madrid","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Madrid Spain","acronym":"PPDP '13"},"container-title":["Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505879.2505899","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2505879.2505899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:17Z","timestamp":1750232057000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505879.2505899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,16]]},"references-count":45,"alternative-id":["10.1145\/2505879.2505899","10.1145\/2505879"],"URL":"https:\/\/doi.org\/10.1145\/2505879.2505899","relation":{},"subject":[],"published":{"date-parts":[[2013,9,16]]},"assertion":[{"value":"2013-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}