{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:06:22Z","timestamp":1770293182094,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,7,14]],"date-time":"2007-07-14T00:00:00Z","timestamp":1184371200000},"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":[[2007,7,14]]},"DOI":"10.1145\/1273920.1273922","type":"proceedings-article","created":{"date-parts":[[2012,10,10]],"date-time":"2012-10-10T14:45:29Z","timestamp":1349880329000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Formalizing and verifying semantic type soundness of a simple compiler"],"prefix":"10.1145","author":[{"given":"Nick","family":"Benton","sequence":"first","affiliation":[{"name":"Microsoft Research"}]},{"given":"Uri","family":"Zarfaty","sequence":"additional","affiliation":[{"name":"Imperial College"}]}],"member":"320","published-online":{"date-parts":[[2007,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90082-5"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1990.113761"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90074-C"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/871816.871860"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325727"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/504709.504712"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964003"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_24"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_12"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11924661_7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11417170_8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_17"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.47"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760037.1760047"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91586"},{"key":"e_1_3_2_1_18_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. International Colloquium on Automata, Languages and Programming (ICALP)","author":"Cardone F.","year":"1989","unstructured":"F. Cardone . Relational semantics for recursive types and bounded quantification . In Proc. International Colloquium on Automata, Languages and Programming (ICALP) , volume 372 of Lecture Notes in Computer Science , 1989 . F. Cardone. Relational semantics for recursive types and bounded quantification. In Proc. International Colloquium on Automata, Languages and Programming (ICALP), volume 372 of Lecture Notes in Computer Science, 1989."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111042"},{"key":"e_1_3_2_1_20_1","series-title":"Proceedings of Symposia in Applied Mathematics","volume-title":"Mathematical Aspect of Computer Science","author":"McCarthy J.","year":"1967","unstructured":"J. McCarthy and J. Painter . Correctness of a compiler for arithmetic expressions . In Mathematical Aspect of Computer Science , volume 19 of Proceedings of Symposia in Applied Mathematics . AMS , 1967 . J. McCarthy and J. Painter. Correctness of a compiler for arithmetic expressions. In Mathematical Aspect of Computer Science, volume 19 of Proceedings of Symposia in Applied Mathematics. AMS, 1967."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/319301.319345"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762174.1762194"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263712"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/647851.737404"},{"key":"e_1_3_2_1_25_1","volume-title":"Higher Order Operational Techniques in Semantics. CUP","author":"Pitts A. M.","year":"1998","unstructured":"A. M. Pitts and I. D. B. Stark . Operational reasoning for functions with local state . In Higher Order Operational Techniques in Semantics. CUP , 1998 . A. M. Pitts and I. D. B. Stark. Operational reasoning for functions with local state. In Higher Order Operational Techniques in Semantics. CUP, 1998."},{"key":"e_1_3_2_1_26_1","volume-title":"Department of AI","author":"Plotkin G. D.","year":"1973","unstructured":"G. D. Plotkin . Lambda definability and logical relations. Technical report , Department of AI , University of Edinburgh , 1973 . G. D. Plotkin. Lambda definability and logical relations. Technical report, Department of AI, University of Edinburgh, 1973."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2004.01.007"},{"key":"e_1_3_2_1_28_1","volume-title":"Information Processing '83","author":"Reynolds J. C.","year":"1983","unstructured":"J. C. Reynolds . Types, abstraction and parametric polymorphism . Information Processing '83 , 1983 . J. C. Reynolds. Types, abstraction and parametric polymorphism. Information Processing '83, 1983."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_4"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1093"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.036"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/83471.83479"}],"event":{"name":"PPDP07: Principles and Practice of Declarative Programming","location":"Wroclaw Poland","acronym":"PPDP07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273920.1273922","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1273920.1273922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:09Z","timestamp":1750258689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1273920.1273922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,14]]},"references-count":31,"alternative-id":["10.1145\/1273920.1273922","10.1145\/1273920"],"URL":"https:\/\/doi.org\/10.1145\/1273920.1273922","relation":{},"subject":[],"published":{"date-parts":[[2007,7,14]]},"assertion":[{"value":"2007-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}