{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:43Z","timestamp":1761611203639},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440390"},{"type":"electronic","value":"9783540456858"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45685-6_14","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T20:47:53Z","timestamp":1179607673000},"page":"198-213","source":"Crossref","is-referenced-by-count":7,"title":["Two-Level Meta-reasoning in Coq"],"prefix":"10.1007","author":[{"given":"Amy P.","family":"Felty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,25]]},"reference":[{"key":"14_CR1","unstructured":"A.W. Appel and A.P. Felty. Lightweight lemmas in \u03bbProlog. In International Conference on Logic Programming, Nov. 1999."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"A.W. Appel and A.P. Felty. A semantic model of types and machine instructions for proof-carrying code. In The 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2000.","DOI":"10.1145\/325694.325727"},{"key":"14_CR3","unstructured":"P. Borras, D. Cl\u00e9ment, T. Despeyroux, J. Incerpi, G. Kahn, B. Lang, and V. Pascual. Centaur: The system. In Proceedings of SIGSOFT\u201988: Third Annual Symposium on Software Development Environments (SDE3), Boston, 1988."},{"key":"14_CR4","series-title":"Lect Notes Comput Sci","volume-title":"First IFIP International Conference on Theoretical Computer Science","author":"J. Despeyroux","year":"2000","unstructured":"J. Despeyroux. A higher-order specification of the \u03c0-calculus. In First IFIP International Conference on Theoretical Computer Science. Springer-Verlag Lecture Notes in Computer Science, 2000."},{"key":"14_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Second International Conference on Typed Lambda Calculi and Applications","author":"J. Despeyroux","year":"1995","unstructured":"J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order abstract syntax in Coq. In Second International Conference on Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science, Apr. 1995."},{"key":"14_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Fifth International Conference on Logic Programming and Automated Reasoning","author":"J. Despeyroux","year":"1994","unstructured":"J. Despeyroux and A. Hirschowitz. Higher-order syntax and induction in coq. In Fifth International Conference on Logic Programming and Automated Reasoning. Springer-Verlag Lecture Notes in Computer Science, 1994."},{"key":"14_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Third International Conference on Typed Lambda Calculi and Applications","author":"J. Despeyroux","year":"1997","unstructured":"J. Despeyroux, F. Pfenning, and C. Sch\u00fcrmann. Primitive recursion for higher-order abstract syntax. In Third International Conference on Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science, 1997."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"L.-H. Eriksson. A finitary version of the calculus of partial inductive definitions. In L.-H. Eriksson, L. Halln\u00e4s, and P. Schroeder-Heister, editors, Proceedings of the January 1991 Workshop on Extensions to Logic Programming. Springer-Verlag Lecture Notes in Artificial Intelligence, 1992.","DOI":"10.1007\/BFb0013605"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40(1), Jan. 1993.","DOI":"10.1145\/138027.138060"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"M. Hofmann. Semantical analysis of higher-order abstract syntax. In Fourteenth Annual Symposium on Logic in Computer Science, 1999.","DOI":"10.1109\/LICS.1999.782616"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"F. Honsell, M. Miculan, and I. Scagnetto. \u03c0-calculus in (co)inductive type theories. Theoretical Computer Science, 253(2), 2001.","DOI":"10.1016\/S0304-3975(00)00095-5"},{"key":"14_CR12","unstructured":"R. McDowell. Reasoning in a Logic with Definitions and Induction. PhD thesis, University of Pennsylvania, December 1997."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"R. McDowell and D. Miller. Reasoning with higher-order abstract syntax in a logical framework. ACM Transactions on Computational Logic, 3(1), Jan. 2002.","DOI":"10.1145\/504077.504080"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"M. Miculan. Developing (meta)theory of \u03bb-calculus in the theory of contexts. Electronic Notes on Theoretical Computer Science, 58, 2001.","DOI":"10.1016\/S1571-0661(04)00278-6"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"M. Miculan. On the formalization of the modal \u03bc-calculus in the calculus of inductive constructions. Information and Computation, 164(1), 2001.","DOI":"10.1006\/inco.2000.2902"},{"key":"14_CR16","unstructured":"G. Nadathur and D. Miller. An overview of \u03bbProlog. In K. Bowen and R. Kowalski, editors, Fifth International Conference and Symposium on Logic Programming. MIT Press, 1988."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"G. Necula. Proof-carrying code. In 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, Jan. 1997.","DOI":"10.1145\/263699.263712"},{"key":"14_CR18","series-title":"Lect Notes Comput Sci","volume-title":"Eleventh International Conference on Automated Deduction","author":"F. Pfenning","year":"1992","unstructured":"F. Pfenning and E. Rohwedder. Implementing the meta-theory of deductive systems. In Eleventh International Conference on Automated Deduction, volume 607. Lecture Notes in Computer Science, 1992."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"F. Pfenning and C. Sch\u00fcrmann. System description: Twelf \u2014 A meta-logical framework for deductive systems. In Sixteenth International Conference on Automated Deduction, volume 1632 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48660-7_14"},{"key":"14_CR20","unstructured":"C. Sch\u00fcrmann. Automating the Meta Theory of Deductive Systems. PhD thesis, Carnegie Mellon University, 2000."},{"key":"14_CR21","unstructured":"The Coq Development Team. The Coq Proof Assistant reference manual: Version 7.2. Technical report, INRIA, 2002."}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45685-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T05:38:22Z","timestamp":1556429902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45685-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440390","9783540456858"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45685-6_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}