{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:48Z","timestamp":1750221168467,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T00:00:00Z","timestamp":1504051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,30]]},"DOI":"10.1145\/3205368.3205374","type":"proceedings-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T12:09:54Z","timestamp":1534248594000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Biorthogonality for a Lazy language"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Fridlender","sequence":"first","affiliation":[{"name":"FaMAF Univ., Nacional de C\u00f3rdoba, C\u00f3rdoba, Argentina"}]},{"given":"Alejandro","family":"Gadea","sequence":"additional","affiliation":[{"name":"FaMAF Univ., Nacional de C\u00f3rdoba, C\u00f3rdoba, Argentina"}]},{"given":"Miguel","family":"Pagano","sequence":"additional","affiliation":[{"name":"FaMAF Univ., Nacional de C\u00f3rdoba, C\u00f3rdoba, Argentina"}]},{"given":"Leonardo","family":"Rodr\u00edguez","sequence":"additional","affiliation":[{"name":"FaMAF Univ., Nacional de C\u00f3rdoba, C\u00f3rdoba, Argentina"}]}],"member":"320","published-online":{"date-parts":[[2017,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1631687.1596567"},{"volume-title":"Lattice Theory","author":"Birkhoff Garret","key":"e_1_3_2_1_2_1","unstructured":"Garret Birkhoff . 1940. Lattice Theory . Vol. 25 . Garret Birkhoff. 1940. Lattice Theory. Vol. 25."},{"key":"e_1_3_2_1_3_1","unstructured":"Joachim Breitner. 2016. Lazy Evaluation: From natural semantics to a machine-checked compiler transformation. Ph.D. Dissertation. Karlsruher Institut f\u00fcr Technologie.  Joachim Breitner. 2016. Lazy Evaluation: From natural semantics to a machine-checked compiler transformation. Ph.D. Dissertation. Karlsruher Institut f\u00fcr Technologie."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273442.1250742"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1520298.1520302"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Graham Hutton and Patrick Bahr. 2017. Compiling a Fifty Year Journey. (2017). In preparation.  Graham Hutton and Patrick Bahr. 2017. Compiling a Fifty Year Journey. (2017). In preparation.","DOI":"10.1017\/S0956796817000120"},{"key":"e_1_3_2_1_7_1","volume-title":"Workshop LOLA","author":"Jaber Guilhem","year":"2010","unstructured":"Guilhem Jaber and Nicolas Tabareau . 2010 . Krivine realizability for compiler correctness . In Workshop LOLA 2010, Syntax and Semantics of Low Level Languages. Edinburgh, United Kingdom. Guilhem Jaber and Nicolas Tabareau. 2010. Krivine realizability for compiler correctness. In Workshop LOLA 2010, Syntax and Semantics of Low Level Languages. Edinburgh, United Kingdom."},{"key":"e_1_3_2_1_8_1","volume-title":"Workshop LOLA","author":"Jaber Guilhem","year":"2011","unstructured":"Guilhem Jaber and Nicolas Tabareau . 2011 . The Journey of Biorthogonal Logical Relations to the Realm of Assembly Code . In Workshop LOLA 2011, Syntax and Semantics of Low Level Languages. Toronto, Canada. Guilhem Jaber and Nicolas Tabareau. 2011. The Journey of Biorthogonal Logical Relations to the Realm of Assembly Code. In Workshop LOLA 2011, Syntax and Semantics of Low Level Languages. Toronto, Canada."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)90047-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158618"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538788.1538814"},{"volume-title":"Mathematical Aspects of Computer Science 1","author":"McCarthy John","key":"e_1_3_2_1_12_1","unstructured":"John McCarthy and James Painter . 1967. Correctness of a compiler for arithmetic expressions . In Mathematical Aspects of Computer Science 1 , Vol. 19 . American Mathematical Society , 33--41. John McCarthy and James Painter. 1967. Correctness of a compiler for arithmetic expressions. In Mathematical Aspects of Computer Science 1, Vol. 19. American Mathematical Society, 33--41."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289439"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863523.1863528"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500003066"},{"volume-title":"Higher Order Operational Techniques in Semantics","author":"Pitts A. M.","key":"e_1_3_2_1_16_1","unstructured":"A. M. Pitts and I. D. B. Stark . 1998. Operational Reasoning for Functions with Local State . In Higher Order Operational Techniques in Semantics , A. D. Gordon and A. M. Pitts (Eds.). Cambridge University Press , 227--273. A. M. Pitts and I. D. B. Stark. 1998. Operational Reasoning for Functions with Local State. In Higher Order Operational Techniques in Semantics, A. D. Gordon and A. M. Pitts (Eds.). Cambridge University Press, 227--273."},{"volume-title":"What Do Types Mean?: From Intrinsic to Extrinsic Semantics","author":"Reynolds John C.","key":"e_1_3_2_1_17_1","unstructured":"John C. Reynolds . 2003. What Do Types Mean?: From Intrinsic to Extrinsic Semantics . In Programming Methodology, Annabelle McIver and Carroll Morgan (Eds.). Springer-Verlag New York, Inc. , New York, NY, USA , 309--327. John C. Reynolds. 2003. What Do Types Mean?: From Intrinsic to Extrinsic Semantics. In Programming Methodology, Annabelle McIver and Carroll Morgan (Eds.). Springer-Verlag New York, Inc., New York, NY, USA, 309--327."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2016.06.013"},{"key":"e_1_3_2_1_20_1","unstructured":"Peter Selinger. 2003. From Continuation Passing Style to Krivine's Abstract Machine. Manuscript. (2003). Available in Peter Selinger's web site.  Peter Selinger. 2003. From Continuation Passing Style to Krivine's Abstract Machine. Manuscript. (2003). Available in Peter Selinger's web site."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002712"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951924"}],"event":{"name":"IFL 2017: 29th Symposium on the Implementation and Application of Functional Programming Languages","sponsor":["ACM Association for Computing Machinery","The University of Bristol The University of Bristol","ERLANG Erlang Solutions Ltd."],"location":"Bristol United Kingdom","acronym":"IFL 2017"},"container-title":["Proceedings of the 29th Symposium on the Implementation and Application of Functional Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205368.3205374","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205368.3205374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:55Z","timestamp":1750208935000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205368.3205374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,30]]},"references-count":21,"alternative-id":["10.1145\/3205368.3205374","10.1145\/3205368"],"URL":"https:\/\/doi.org\/10.1145\/3205368.3205374","relation":{},"subject":[],"published":{"date-parts":[[2017,8,30]]},"assertion":[{"value":"2017-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}