{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:27Z","timestamp":1772163927542,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T00:00:00Z","timestamp":1168992000000},"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,1,17]]},"DOI":"10.1145\/1190216.1190245","type":"proceedings-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T15:41:00Z","timestamp":1175787660000},"page":"173-184","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":56,"title":["Towards a mechanized metatheory of standard ML"],"prefix":"10.1145","author":[{"given":"Daniel K.","family":"Lee","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl","family":"Crary","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Harper","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,1,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt H. P.","year":"1984","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. Elsevier, 1984."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45085-6_9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/582153.582176"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645892.671587"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604151"},{"key":"e_1_3_2_1_8_1","volume-title":"Formal Syntax and Semantics of Java","author":"Drossopoulou Sophia","year":"1998","unstructured":"Sophia Drossopoulou and Susan Eisenbach. Towards an operational semantics and proof of type soundness for Java. In Formal Syntax and Semantics of Java. Springer-Verlag, March 1998."},{"key":"e_1_3_2_1_9_1","volume-title":"September 2000 Technical report","author":"Drossopoulou Sophia","unstructured":"Sophia Drossopoulou, Tanya Valkevych, and Susan Eisenbach. Java type soundness revisited, September 2000 Technical report, Imperial College London."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/155278"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90120-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138060"},{"key":"e_1_3_2_1_13_1","volume-title":"April","author":"Harper Robert","year":"2006","unstructured":"Robert Harper and Daniel R. Licata. Mechanizing language definitions. Submitted for publication, April 2006."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.176927"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/96709.96744"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/345868.345906"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.176926"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199476"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/549659"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224182"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00248324"},{"key":"e_1_3_2_1_26_1","unstructured":"Frank Pfenning. Computation and deduction. Lecture notes available electronically at http:\/\/www.cs.cmu.edu\/char\"7Etwelf."},{"key":"e_1_3_2_1_27_1","volume-title":"Version 1.4","author":"Pfenning Frank","year":"2002","unstructured":"Frank Pfenning and Carsten Sch\u00fcrmann. Twelf User's Guide, Version 1.4, 2002. Available electronically at http:\/\/www.cs.cmu.edu\/char\"7Etwelf."},{"key":"e_1_3_2_1_28_1","volume-title":"Workshop of Automation of Proofs by Mathematical Induction","author":"Pientka Brigitte","year":"2000","unstructured":"Brigitte Pientka and Frank Pfenning. Termination and reduction checking in the logical framework. In Workshop of Automation of Proofs by Mathematical Induction, June 2000."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00096-5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/509043"},{"key":"e_1_3_2_1_32_1","first-page":"345","volume-title":"Proceedings of the International Symposium on Algorithmic Languages","author":"Reynolds John C.","year":"1981","unstructured":"John C. Reynolds. The essence of Algol. In J. W. de Bakker and J. C. van Vliet, editors, Proceedings of the International Symposium on Algorithmic Languages, pages 345--372, Amsterdam, October 1981. North-Holland."},{"key":"e_1_3_2_1_33_1","volume-title":"A proof-theoretic account of logical relations. Submitted for publication","author":"Sarnat Jeffrey","year":"2006","unstructured":"Jeffrey Sarnat and Carsten Sch\u00fcrmann. A proof-theoretic account of logical relations. Submitted for publication, 2006."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183278.1183281"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/646520.694244"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/231379.231414"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/646520.694367"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24849-1_23"}],"event":{"name":"POPL07: The 34th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Nice France","acronym":"POPL07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1190216.1190245","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1190216.1190245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:47:42Z","timestamp":1750243662000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1190216.1190245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,17]]},"references-count":31,"alternative-id":["10.1145\/1190216.1190245","10.1145\/1190216"],"URL":"https:\/\/doi.org\/10.1145\/1190216.1190245","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1190215.1190245","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,1,17]]},"assertion":[{"value":"2007-01-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}