{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:28Z","timestamp":1750306348632,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T00:00:00Z","timestamp":1466640000000},"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":[[2016,6,23]]},"DOI":"10.1145\/2966268.2966272","type":"proceedings-article","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T14:28:57Z","timestamp":1473431337000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Implementing HOL in an Higher Order Logic Programming Language"],"prefix":"10.1145","author":[{"given":"Cvetan","family":"Dunchev","sequence":"first","affiliation":[{"name":"University of Bologna"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio Sacerdoti","family":"Coen","sequence":"additional","affiliation":[{"name":"University of Bologna"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Tassi","sequence":"additional","affiliation":[{"name":"INRIA Sophia-Antipolis"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"411","volume-title":"Logic Programming: The 1999 International Conference","author":"Appel A. W.","year":"1999","unstructured":"A. W. Appel and A. P. Felty . Lightweight Lemmas in lambda-Prolog . In Logic Programming: The 1999 International Conference , Las Cruces , New Mexico, USA, November 29-December 4, 1999 , pages 411 -- 425 . MIT Press , 1999. ISBN 0-262-54104-1. A. W. Appel and A. P. Felty. Lightweight Lemmas in lambda-Prolog. In Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29-December 4, 1999, pages 411--425. MIT Press, 1999. ISBN 0-262-54104-1."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-016-9366-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1836089.1836118"},{"key":"e_1_3_2_1_5_1","volume-title":"Translating between implicit and explicit versions of proof. Unpublished","author":"Blanco R.","year":"2015","unstructured":"R. Blanco , Z. Chihani , and D. Miller . Translating between implicit and explicit versions of proof. Unpublished , 2015 . URL http:\/\/www.lix.polytechnique.fr\/Labo\/Dale.Miller\/papers\/implicit-explicit-draft.pdf. R. Blanco, Z. Chihani, and D. Miller. Translating between implicit and explicit versions of proof. Unpublished, 2015. URL http:\/\/www.lix.polytechnique.fr\/Labo\/Dale.Miller\/papers\/implicit-explicit-draft.pdf."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38574-2_11"},{"key":"e_1_3_2_1_7_1","volume-title":"Indagationes Mathematicae","volume":"356","author":"de Bruijn N. G.","year":"1978","unstructured":"N. G. de Bruijn . Lambda calculus with namefree formulas in involving symbols that represent reference transforming mappings . In Indagationes Mathematicae , volume 81(3), pages 348-- 356 , 1978 . N. G. de Bruijn. Lambda calculus with namefree formulas in involving symbols that represent reference transforming mappings. In Indagationes Mathematicae, volume 81(3), pages 348--356, 1978."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765236.1765246"},{"key":"e_1_3_2_1_9_1","first-page":"460","volume-title":"Artificial Intelligence and Reasoning: 20th International Conference, LPAR-20 2015, Suva, Fiji, 2015, Proceedings","author":"Dunchev C.","year":"2015","unstructured":"C. Dunchev , F. Guidi , C. Sacerdoti Coen , and E. Tassi . ELPI: Fast, Embeddable, lambda-Prolog Interpreter. In Logic for Programming , Artificial Intelligence and Reasoning: 20th International Conference, LPAR-20 2015, Suva, Fiji, 2015, Proceedings , pages 460 -- 468 . Springer Berlin Heidelberg , 2015 . ISBN 978-3-662-48899-7. doi: 10.1007\/978-3-662-48899-7_32. 10.1007\/978-3-662-48899-7_32 C. Dunchev, F. Guidi, C. Sacerdoti Coen, and E. Tassi. ELPI: Fast, Embeddable, lambda-Prolog Interpreter. In Logic for Programming, Artificial Intelligence and Reasoning: 20th International Conference, LPAR-20 2015, Suva, Fiji, 2015, Proceedings, pages 460--468. Springer Berlin Heidelberg, 2015. ISBN 978-3-662-48899-7. doi: 10.1007\/978-3-662-48899-7_32."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00881900"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/648228.752130"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10005-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28934-2_11"},{"key":"e_1_3_2_1_14_1","series-title":"Real-Time Safety Critical Systems","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/B978-0-444-89901-9.50012-4","volume-title":"Towards Verified Systems","author":"Gordon M. J. C.","year":"1994","unstructured":"M. J. C. Gordon and A. M. Pitts . The HOL logic and system . In J. Bowen, editor, Towards Verified Systems , volume 2 of Real-Time Safety Critical Systems , chapter 3, pages 49 -- 70 . Elsevier Science B.V. , 1994 . M. J. C. Gordon and A. M. Pitts. The HOL logic and system. In J. Bowen, editor, Towards Verified Systems, volume 2 of Real-Time Safety Critical Systems, chapter 3, pages 49--70. Elsevier Science B.V., 1994."},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09724-4","volume-title":"Edinburgh LCF","author":"Gordon M. J. C.","year":"1979","unstructured":"M. J. C. Gordon , R. Milner , and C. P. Wadsworth . Edinburgh LCF , volume 78 of Lecture Notes in Computer Science . Springer , 1979 . ISBN 3-540-09724-4. doi: 10.1007\/3-540-09724-4. 10.1007\/3-540-09724-4 M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF, volume 78 of Lecture Notes in Computer Science. Springer, 1979. ISBN 3-540-09724-4. doi: 10.1007\/3-540-09724-4."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03359-9_4"},{"key":"e_1_3_2_1_18_1","volume-title":"Projet Cristal","author":"Leroy X.","year":"2004","unstructured":"X. Leroy , D. Doligez , J. Garrigue , D. R\u00e9my , and J. Vouillon . The Objective Caml system release 3.08, Documentation and users manual . In Projet Cristal , INRIA , 2004 . X. Leroy, D. Doligez, J. Garrigue, D. R\u00e9my, and J. Vouillon. The Objective Caml system release 3.08, Documentation and users manual. In Projet Cristal, INRIA, 2004."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39634-2_5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0747-7171(92)90011-R"},{"key":"e_1_3_2_1_21_1","first-page":"150","volume-title":"Proofs for All (APPA)","author":"Miller D.","year":"2014","unstructured":"D. Miller . Foundational Proof Certificates. In All about Proofs , Proofs for All (APPA) , pages 150 -- 163 , 2014 . D. Miller. Foundational Proof Certificates. In All about Proofs, Proofs for All (APPA), pages 150--163, 2014."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/648235.753631"},{"key":"e_1_3_2_1_23_1","volume-title":"Journal of Functional and Logic Programming -","author":"Nadathur G.","year":"1999","unstructured":"G. Nadathur and G. Tong . Realizing Modularity in lambdaProlog . Journal of Functional and Logic Programming - March 15, 1999 , 1999(Special Issue 2) , 1999. G. Nadathur and G. Tong. Realizing Modularity in lambdaProlog. Journal of Functional and Logic Programming - March 15, 1999, 1999(Special Issue 2), 1999."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2006.09.026"},{"key":"e_1_3_2_1_25_1","volume-title":"Proof Search in Type Theory","author":"Spiwack A.","year":"2010","unstructured":"A. Spiwack . An abstract type for constructing tactics in Coq . In Proof Search in Type Theory , Edinburgh, United Kingdom , July 2010 a. URL https:\/\/hal.inria.fr\/inria-00502500. A. Spiwack. An abstract type for constructing tactics in Coq. In Proof Search in Type Theory, Edinburgh, United Kingdom, July 2010a. URL https:\/\/hal.inria.fr\/inria-00502500."},{"key":"e_1_3_2_1_26_1","volume-title":"An abstract type for constructing tactics in coq. Unpublished","author":"Spiwack A.","year":"2010","unstructured":"A. Spiwack . An abstract type for constructing tactics in coq. Unpublished , 2010 b. URL http:\/\/assert-false.net\/arnaud\/papers\/An%20abstract%20type%20for%20constructing%20tactics%20in%20Coq.pdf. A. Spiwack. An abstract type for constructing tactics in coq. Unpublished, 2010b. URL http:\/\/assert-false.net\/arnaud\/papers\/An%20abstract%20type%20for%20constructing%20tactics%20in%20Coq.pdf."},{"key":"e_1_3_2_1_27_1","first-page":"260","volume-title":"MKM 2011, Bertinoro, Italy, July 18-23, 2011. Proceedings","author":"Whiteside I.","year":"2011","unstructured":"I. Whiteside , D. Aspinall , L. Dixon , and G. Grov . Towards Formal Proof Script Refactoring. In Intelligent Computer Mathematics - 18th Symposium, Calculemus 2011, and 10th International Conference , MKM 2011, Bertinoro, Italy, July 18-23, 2011. Proceedings , pages 260 -- 275 , 2011 . doi: 10.1007\/978-3-642-22673-1_18. 10.1007\/978-3-642-22673-1_18 I. Whiteside, D. Aspinall, L. Dixon, and G. Grov. Towards Formal Proof Script Refactoring. In Intelligent Computer Mathematics - 18th Symposium, Calculemus 2011, and 10th International Conference, MKM 2011, Bertinoro, Italy, July 18-23, 2011. Proceedings, pages 260--275, 2011. doi: 10.1007\/978-3-642-22673-1_18."},{"key":"e_1_3_2_1_28_1","volume-title":"Foreword by Dana S. Scott (Lecture Notes in Computer Science \/ Lecture Notes in Artificial Intelligence)","author":"Wiedijk F.","year":"2006","unstructured":"F. Wiedijk . The Seventeen Provers of the World : Foreword by Dana S. Scott (Lecture Notes in Computer Science \/ Lecture Notes in Artificial Intelligence) . Springer-Verlag New York, Inc. , Secaucus, NJ, USA , 2006 . ISBN 3540307044. F. Wiedijk. The Seventeen Provers of the World: Foreword by Dana S. Scott (Lecture Notes in Computer Science \/ Lecture Notes in Artificial Intelligence). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006. ISBN 3540307044."}],"event":{"name":"LFMTP '16: Theory and Practice","acronym":"LFMTP '16","location":"Porto Portugal"},"container-title":["Proceedings of the Eleventh Workshop on Logical Frameworks and Meta-Languages: Theory and Practice"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2966268.2966272","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2966268.2966272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:53Z","timestamp":1750222553000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2966268.2966272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,23]]},"references-count":28,"alternative-id":["10.1145\/2966268.2966272","10.1145\/2966268"],"URL":"https:\/\/doi.org\/10.1145\/2966268.2966272","relation":{},"subject":[],"published":{"date-parts":[[2016,6,23]]},"assertion":[{"value":"2016-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}