{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:10Z","timestamp":1725490090304},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745907"},{"type":"electronic","value":"9783540745914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74591-4_19","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T14:49:52Z","timestamp":1187794192000},"page":"246-261","source":"Crossref","is-referenced-by-count":7,"title":["Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF"],"prefix":"10.1007","author":[{"given":"Brigitte","family":"Pientka","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/11541868_4","volume-title":"Theorem Proving in Higher Order Logics","author":"B. Aydemir","year":"2005","unstructured":"Aydemir, B., Bohannon, A., Fairbairn, M., Foster, J., Pierce, B., Sewell, P., Vytiniotis, D., Washburn, G., Weirich, S., Zdancewic, S.: Mechanized metatheory for the masses: The POPLmark challenge. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 50\u201365. Springer, Heidelberg (2005)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-45685-6_14","volume-title":"Theorem Proving in Higher Order Logics","author":"A.P. Felty","year":"2002","unstructured":"Felty, A.P.: Two-level meta-reasoning in Coq. In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol.\u00a02410, pp. 198\u2013213. Springer, Heidelberg (2002)"},{"issue":"1","key":"19_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1993","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the Association for Computing Machinery\u00a040(1), 143\u2013184 (1993)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"19_CR4","unstructured":"Harper, R., Licata, D.: Mechanizing metatheory in a logical framework (submitted for publication)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/3-540-36576-1_24","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Momigliano","year":"2003","unstructured":"Momigliano, A., Ambler, S.J.: Multi-level meta-reasoning with higher-order abstract syntax. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol.\u00a02620, pp. 375\u2013391. Springer, Heidelberg (2003)"},{"key":"19_CR6","unstructured":"Crary, K., Ashley-Rollman, M., Harper, R.: Twelf solution to POPLmark challenge, electronically available at \n                  \n                    http:\/\/fling-l.seas.upenn.edu\/~plclub\/cgi-bin\/poplmark\/"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/504077.504080","volume":"3","author":"R.C. McDowell","year":"2002","unstructured":"McDowell, R.C., Miller, D.A.: Reasoning with higher-order abstract syntax in a logical framework. ACM Transactions on Computational Logic\u00a03(1), 80\u2013136 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1017\/CBO9780511569807.008","volume-title":"Logical Frameworks","author":"F. Pfenning","year":"1991","unstructured":"Pfenning, F.: Logic programming in the LF logical framework. In: Huet, G., Plotkin, G. (eds.) Logical Frameworks, pp. 149\u2013181. Cambridge University Press, Cambridge (1991)"},{"key":"19_CR9","unstructured":"Pfenning, F.: Computation and deduction (1997)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-45619-8_19","volume-title":"Logic Programming","author":"B. Pientka","year":"2002","unstructured":"Pientka, B.: A proof-theoretic foundation for tabled higher-order logic programming. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 271\u2013286. Springer, Heidelberg (2002)"},{"key":"19_CR11","volume-title":"Types and Programming Languages","author":"B.C. Pierce","year":"2002","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)"},{"key":"19_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/11532231_5","volume-title":"Automated Deduction \u2013 CADE-20","author":"B. Pientka","year":"2005","unstructured":"Pientka, B.: Tabling for higher-order logic programming. In: Nieuwenhuis, R. (ed.) Automated Deduction \u2013 CADE-20. LNCS (LNAI), vol.\u00a03632, pp. 54\u201368. Springer, Heidelberg (2005)"},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10817-005-6534-3","volume":"34","author":"B. Pientka","year":"2005","unstructured":"Pientka, B.: Verifying termination and reduction properties about higher-order logic programs. Journal of Automated Reasoning\u00a034(2), 179\u2013207 (2005)","journal-title":"Journal of Automated Reasoning"},{"key":"19_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction - CADE-16","author":"F. Pfenning","year":"1999","unstructured":"Pfenning, F., Sch\u00fcrmann, C.: System description: Twelf \u2014 a meta-logical framework for deductive systems. In: Ganzinger, H. (ed.) Automated Deduction - CADE-16. LNCS (LNAI), vol.\u00a01632, pp. 202\u2013206. Springer, Heidelberg (1999)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/3-540-61055-3_44","volume-title":"Programming Languages and Systems - ESOP \u201996","author":"E. Rohwedder","year":"1996","unstructured":"Rohwedder, E., Pfenning, F.: Mode and termination checking for higher-order logic programs. In: Nielson, H.R. (ed.) ESOP 1996. LNCS, vol.\u00a01058, pp. 296\u2013310. Springer, Heidelberg (1996)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/10930755_8","volume-title":"Theorem Proving in Higher Order Logics","author":"C. Sch\u00fcrmann","year":"2003","unstructured":"Sch\u00fcrmann, C., Pfenning, F.: A coverage checking algorithm for LF. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol.\u00a02758, pp. 120\u2013135. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74591-4_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:08Z","timestamp":1619519288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74591-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745907","9783540745914"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74591-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}