{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:37Z","timestamp":1772163997400,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T00:00:00Z","timestamp":1199664000000},"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":[[2008,1,7]]},"DOI":"10.1145\/1328438.1328482","type":"proceedings-article","created":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T09:45:40Z","timestamp":1199699140000},"page":"359-369","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Focusing and higher-order abstract syntax"],"prefix":"10.1145","author":[{"given":"Noam","family":"Zeilberger","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2008,1,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800000186"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.3.297"},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Coinductive axiomatization of recursive type equaility and subtyping","volume":"20","author":"Brandt Michael","year":"1998","journal-title":"Fundamenta Informaticae"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0091894"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.032"},{"key":"e_1_3_2_1_6_1","volume-title":"INRIA","author":"Development Team The Coq","year":"2006"},{"key":"e_1_3_2_1_7_1","first-page":"71","volume-title":"Proceedings of the Workshop on Types for Proofs and Programs","author":"Coquand Thierry","year":"1992"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90005-3"},{"key":"e_1_3_2_1_9_1","volume-title":"LNCS 389","author":"Coquand Thierry","year":"1989"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351262"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Jo\u00eblle\n       \n      Despeyroux Amy\n       \n      Felty and \n      \n      \n      Andr\u00e9\n       \n      Hirschowitz\n    .\n      \n  \n   \n  Higher-order abstract syntax in Coq. In M. Dezani-Ciancaglini and G. Plotkin editors Proceedings of the International Conference on Typed Lambda Calculi and Applications volume \n  902\n   of \n  LNCS pages \n  124\n  --\n  138 Edinburgh Scotland 1995\n  . \n  Springer-Verlag\n  .   Jo\u00eblle Despeyroux Amy Felty and Andr\u00e9 Hirschowitz. Higher-order abstract syntax in Coq. In M. Dezani-Ciancaglini and G. Plotkin editors Proceedings of the International Conference on Typed Lambda Calculi and Applications volume 902 of LNCS pages 124--138 Edinburgh Scotland 1995. Springer-Verlag.","DOI":"10.1007\/BFb0014049"},{"key":"e_1_3_2_1_13_1","first-page":"53785","volume-title":"The William James Lectures, 1976","author":"Dummett Michael","year":"1991"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780342_19"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155113"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01201353"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096012950100336X"},{"key":"e_1_3_2_1_18_1","volume-title":"CSL '94: Proceedings of the 8th International Workshop on Computer Science Logic","author":"Herbelin Hugo","year":"1995"},{"key":"e_1_3_2_1_19_1","volume-title":"University of St Andrews","author":"Howe Jacob M.","year":"1998"},{"key":"e_1_3_2_1_20_1","volume-title":"Van Nostrand","author":"Kleene Steven C.","year":"1952"},{"key":"e_1_3_2_1_21_1","volume-title":"Universit\u00e9 Aix-Marseille II","author":"Laurent Olivier","year":"2002"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129505004895"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)70847-4"},{"issue":"1","key":"e_1_3_2_1_24_1","first-page":"11","article-title":"On the meanings of the logical constants and the justifications of the logical laws","volume":"1","author":"Martin-L\u00f6f Per","year":"1996","journal-title":"Nordic Journal of Philosophical Logic"},{"key":"e_1_3_2_1_25_1","volume-title":"CSL '07: Proceedings of the 21st International Workshop on Computer Science Logic.","author":"Miller Dale","year":"2007"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1352582.1352591"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129501003322"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54010"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328483"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/800194.805852"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00418-7"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096012950000311X"},{"key":"e_1_3_2_1_34_1","volume-title":"Cambridge University Press","author":"Anne","year":"1996"},{"key":"e_1_3_2_1_35_1","unstructured":"Twelf 2007. The Twelf Project 2007. http:\/\/twelf.plparty.org\/.  Twelf 2007. The Twelf Project 2007. http:\/\/twelf.plparty.org\/."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944723"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/645722.666394"},{"key":"e_1_3_2_1_38_1","volume-title":"Annals of Pure and Applied Logic","author":"Zeilberger Noam","year":"2007"}],"event":{"name":"POPL08: The 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"San Francisco California USA","acronym":"POPL08","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 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328438.1328482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1328438.1328482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:56:07Z","timestamp":1750240567000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1328438.1328482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,7]]},"references-count":38,"alternative-id":["10.1145\/1328438.1328482","10.1145\/1328438"],"URL":"https:\/\/doi.org\/10.1145\/1328438.1328482","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1328897.1328482","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,1,7]]},"assertion":[{"value":"2008-01-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}