{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:46Z","timestamp":1750306786808,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"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":[{"name":"INRIA Associated Team RAPT"},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["OISE-1045885 (REUSSI-2), CCF-0917140"],"award-info":[{"award-number":["OISE-1045885 (REUSSI-2), CCF-0917140"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000089","name":"Office of International Science and Engineering","doi-asserted-by":"publisher","award":["OISE-1045885 (REUSSI-2), CCF-0917140"],"award-info":[{"award-number":["OISE-1045885 (REUSSI-2), CCF-0917140"]}],"id":[{"id":"10.13039\/100000089","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.2505889","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T19:57:05Z","timestamp":1379447825000},"page":"157-168","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Reasoning about higher-order relational specifications"],"prefix":"10.1145","author":[{"given":"Yuting","family":"Wang","sequence":"first","affiliation":[{"name":"University of Minnesota"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaustuv","family":"Chaudhuri","sequence":"additional","affiliation":[{"name":"INRIA, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Gacek","sequence":"additional","affiliation":[{"name":"Rockwell Collins"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gopalan","family":"Nadathur","sequence":"additional","affiliation":[{"name":"University of Minnesota"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,16]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The Abella prover 2013. Available at http:\/\/abella-prover.org\/.  The Abella prover 2013. Available at http:\/\/abella-prover.org\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35308-6_15"},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/978-3-540-27775-0_19","volume-title":"Logic Programming, 20th International Conference","author":"Cheney J.","year":"2004","unstructured":"J. Cheney and C. Urban . Alpha-Prolog: A logic programming language with names, binding, and alpha-equivalence . In B. Demoen and V. Lifschitz, editors, Logic Programming, 20th International Conference , volume 3132 of LNCS , pages 269 -- 283 . Springer , 2004 . J. Cheney and C. Urban. Alpha-Prolog: A logic programming language with names, binding, and alpha-equivalence. In B. Demoen and V. Lifschitz, editors, Logic Programming, 20th International Conference, volume 3132 of LNCS, pages 269--283. Springer, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1387673.1387675"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/2266170"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"e_1_3_2_1_7_1","series-title":"LNAI","first-page":"221","volume-title":"Proceedings of the 1990 Conference on Automated Deduction","author":"Felty A.","year":"1990","unstructured":"A. Felty and D. Miller . Encoding a dependent-type \u03bb-calculus in a logic programming language . In M. Stickel, editor, Proceedings of the 1990 Conference on Automated Deduction , volume 449 of LNAI , pages 221 -- 235 . Springer , 1990 . A. Felty and D. Miller. Encoding a dependent-type \u03bb-calculus in a logic programming language. In M. Stickel, editor, Proceedings of the 1990 Conference on Automated Deduction, volume 449 of LNAI, pages 221--235. Springer, 1990."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9194-x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.09.004"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-011-9218-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.041"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/504077.504080"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2331097"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90068-W"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094622.1094628"},{"key":"e_1_3_2_1_17_1","first-page":"810","volume-title":"Fifth International Logic Programming Conference","author":"Nadathur G.","year":"1988","unstructured":"G. Nadathur and D. Miller . An Overview of \u03bbProlog . In Fifth International Logic Programming Conference , pages 810 -- 827 , Seattle , Aug. 1988 . MIT Press. G. Nadathur and D. Miller. An Overview of \u03bbProlog. In Fifth International Logic Programming Conference, pages 810--827, Seattle, Aug. 1988. MIT Press."},{"key":"e_1_3_2_1_18_1","first-page":"202","volume-title":"16th Conf. on Automated Deduction (CADE), number 1632 in LNAI","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 , 16th Conf. on Automated Deduction (CADE), number 1632 in LNAI , pages 202 -- 206 , Trento , 1999 . Springer. F. Pfenning and C. Sch\u00fcrmann. System description: Twelf --- A meta-logical framework for deductive systems. In H. Ganzinger, editor, 16th Conf. on Automated Deduction (CADE), number 1632 in LNAI, pages 202--206, Trento, 1999. Springer."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14203-1_2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39634-2_29"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944729"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1836089.1836113"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11417170_29"}],"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.2505889","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2505879.2505889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:16Z","timestamp":1750232056000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505879.2505889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,16]]},"references-count":22,"alternative-id":["10.1145\/2505879.2505889","10.1145\/2505879"],"URL":"https:\/\/doi.org\/10.1145\/2505879.2505889","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"}}]}}