{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:16Z","timestamp":1750307476556,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T00:00:00Z","timestamp":1280102400000},"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":[[2010,7,26]]},"DOI":"10.1145\/1836089.1836113","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"187-198","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A meta-programming approach to realizing dependently typed logic programming"],"prefix":"10.1145","author":[{"given":"Zachary","family":"Snow","sequence":"first","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Baelde","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gopalan","family":"Nadathur","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7,26]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/978-3-642-14203-1_24"},{"key":"e_1_3_2_1_3_1","volume-title":"ILPS Workshop: Implementation Techniques for Logic Programming Languages","author":"Brisset P.","year":"1994","unstructured":"P. Brisset and O. Ridoux . The architecture of an implementation of lambda-Prolog: Prolog\/Mali . In ILPS Workshop: Implementation Techniques for Logic Programming Languages , 1994 . P. Brisset and O. Ridoux. The architecture of an implementation of lambda-Prolog: Prolog\/Mali. In ILPS Workshop: Implementation Techniques for Logic Programming Languages, 1994."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.2307\/2266170"},{"key":"e_1_3_2_1_6_1","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-52885-7_90","volume-title":"Tenth International 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 . InM. Stickel, editor, Tenth International 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. InM. Stickel, editor, Tenth International Conference on Automated Deduction, volume 449 of LNAI, pages 221--235. Springer, 1990."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/978-3-540-71070-7_13"},{"key":"e_1_3_2_1_9_1","volume-title":"The Teyjus system - version","author":"Gacek A.","year":"2008","unstructured":"A. Gacek , S. Holte , G. Nadathur , X. Qi , and Z. Snow . The Teyjus system - version 2, Mar. 2008 . Available from http:\/\/teyjus.cs.umn.edu\/. A. Gacek, S. Holte, G. Nadathur, X. Qi, and Z. Snow. The Teyjus system - version 2, Mar. 2008. Available from http:\/\/teyjus.cs.umn.edu\/."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/LICS.2008.33"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/138027.138060"},{"key":"e_1_3_2_1_12_1","first-page":"479","volume-title":"To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism","author":"Howard W. A.","year":"1980","unstructured":"W. A. Howard . The formulae-as-type notion of construction . In J. P. Seldin and R. Hindley, editors, To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism , pages 479 -- 490 . Academic Press , New York , 1980 . W. A. Howard. The formulae-as-type notion of construction. In J. P. Seldin and R. Hindley, editors, To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism, pages 479--490. Academic Press, New York, 1980."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1093\/logcom\/1.4.497"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/1094622.1094628"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1016\/0168-0072(91)90068-W"},{"key":"e_1_3_2_1_16_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 . MIT Press , 1988 . G. Nadathur and D. Miller. An Overview of \u03bbProlog. In Fifth International Logic Programming Conference, pages 810--827. MIT Press, 1988."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/263699.263712"},{"key":"e_1_3_2_1_18_1","first-page":"64","volume-title":"Proc. 8th IEEE Symposium on Logic in Computer Science","author":"Nipkow T.","year":"1993","unstructured":"T. Nipkow . Functional unification of higher-order patterns. In M. Vardi, editor , Proc. 8th IEEE Symposium on Logic in Computer Science , pages 64 -- 74 . IEEE Computer Society Press , June 1993 . T. Nipkow. Functional unification of higher-order patterns. In M. Vardi, editor, Proc. 8th IEEE Symposium on Logic in Computer Science, pages 64--74. IEEE Computer Society Press, June 1993."},{"doi-asserted-by":"crossref","unstructured":"F.\n      Pfenning\n     and \n      C.\n      Sch\u00fcrmann\n  . \n  System description: Twelf--A metalogical framework for deductive systems\n  . In H. Ganzinger editor 16th International Conference on Automated Deduction volume \n  1632\n   of \n  LNAI pages \n  202\n  --\n  206\n  . \n  Springer 1999\n  .   F. Pfenning and C. Sch\u00fcrmann. System description: Twelf--A metalogical framework for deductive systems. In H. Ganzinger editor 16th International Conference on Automated Deduction volume 1632 of LNAI pages 202--206. Springer 1999.","key":"e_1_3_2_1_19_1","DOI":"10.1007\/3-540-48660-7_14"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/11814771_32"},{"doi-asserted-by":"crossref","unstructured":"B.\n      Pientka\n     and \n      F.\n      Pfenning\n  . \n  Optimizing higher-order pattern unification\n  . In F. Baader editor 19th International Conference on Automated Deduction volume \n  2741\n   of \n  LNCS pages \n  473\n  --\n  487\n  . \n  Springer 2003\n  .  B. Pientka and F. Pfenning. Optimizing higher-order pattern unification. In F. Baader editor 19th International Conference on Automated Deduction volume 2741 of LNCS pages 473--487. Springer 2003.","key":"e_1_3_2_1_21_1","DOI":"10.1007\/978-3-540-45085-6_40"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1016\/j.entcs.2007.11.014"},{"key":"e_1_3_2_1_23_1","volume-title":"http:\/\/www.cs.umn.edu\/~snow\/parinati","author":"Snow Z.","year":"2010","unstructured":"Z. Snow . Parinati. http:\/\/www.cs.umn.edu\/~snow\/parinati , 2010 . Z. Snow. Parinati. http:\/\/www.cs.umn.edu\/~snow\/parinati, 2010."},{"key":"e_1_3_2_1_24_1","volume-title":"Realizing the dependently typed \u03bb-calculus. Master's thesis","author":"Snow Z.","year":"2010","unstructured":"Z. Snow . Realizing the dependently typed \u03bb-calculus. Master's thesis , University of Minnesota , 2010 . Z. Snow. Realizing the dependently typed \u03bb-calculus. Master's thesis, University of Minnesota, 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1016\/S0747-7171(08)80139-3"}],"event":{"sponsor":["Johannes Kepler University, Linz, Austria","SIGPLAN ACM Special Interest Group on Programming Languages"],"acronym":"PPDP '10","name":"PPDP '10: Principles and Practice of Declarative Programming","location":"Hagenberg Austria"},"container-title":["Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1836089.1836113","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1836089.1836113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:51Z","timestamp":1750248531000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1836089.1836113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,26]]},"references-count":22,"alternative-id":["10.1145\/1836089.1836113","10.1145\/1836089"],"URL":"https:\/\/doi.org\/10.1145\/1836089.1836113","relation":{},"subject":[],"published":{"date-parts":[[2010,7,26]]},"assertion":[{"value":"2010-07-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}