{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:00:40Z","timestamp":1725559240915},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140518"},{"type":"electronic","value":"9783642140525"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14052-5_9","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T10:23:14Z","timestamp":1278930194000},"page":"99-114","source":"Crossref","is-referenced-by-count":6,"title":["A Tactic Language for Declarative Proofs"],"prefix":"10.1007","author":[{"given":"Serge","family":"Autexier","sequence":"first","affiliation":[]},{"given":"Dominik","family":"Dietrich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Abel, A., Chang, B.-Y.E., Pfenning, F.: Human-readable machine-verifiable proofs for teaching constructive logic. In: Egly, U., Fiedler, A., Horacek, H., Schmitt, S. (eds.) Proceedings of the Workshop on Proof Transformations, Proof Presentations and Complexity of Proofs (PTP \u201901), Universit\u00e1 degli studi di Siena (June 2001)"},{"key":"9_CR2","unstructured":"Autexier, S., Benzm\u00fcller, C., Dietrich, D., Wagner, M.: Organisation, transformation, and propagation of mathematical knowledge in Omega. Journal Mathematics in Computer Science"},{"key":"9_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11618027_7","volume-title":"Mathematical Knowledge Management","author":"S. Autexier","year":"2006","unstructured":"Autexier, S., Fiedler, A.: Textbook proofs meet formal logic - the problem of underspecification and granularity. In: Kohlhase, M. (ed.) MKM 2005. LNCS (LNAI), vol.\u00a03863, pp. 96\u2013110. Springer, Heidelberg (2006)"},{"key":"9_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BFb0055903","volume-title":"Artificial Intelligence and Symbolic Computation","author":"M. Beeson","year":"1998","unstructured":"Beeson, M.: Automatic generation of epsilon-delta proofs of continuity. In: Calmet, J., Plaza, J.A. (eds.) AISC 1998. LNCS (LNAI), vol.\u00a01476, pp. 67\u201383. Springer, Heidelberg (1998)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Theorem Proving in Higher Order Logics","year":"1999","unstructured":"Bertot, Y., Dowek, G., Hirschowitz, A., Paulin-Mohring, C., Th\u00e9ry, L. (eds.): TPHOLs 1999. LNCS, vol.\u00a01690. Springer, Heidelberg (1999)"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF00244493","volume":"6","author":"W.W. Bledsoe","year":"1990","unstructured":"Bledsoe, W.W.: Challenge problems in elementary calculus. J. Autom. Reasoning\u00a06(3), 341\u2013359 (1990)","journal-title":"J. Autom. Reasoning"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1142\/S0129054101000412","volume":"12","author":"P. Borovansky","year":"2001","unstructured":"Borovansky, P., Kirchner, C., Kirchner, H., Ringeissen, C.: Rewriting with strategies in ELAN: A functional semantics. International Journal of Foundations of Computer Science\u00a012(1), 69\u201395 (2001)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"9_CR8","volume-title":"A Computational Logic Handbook","author":"R.S. Boyer","year":"1988","unstructured":"Boyer, R.S., Moore, J.S.: A Computational Logic Handbook. Academic Press, London (1988)"},{"key":"9_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11812289_10","volume-title":"Mathematical Knowledge Management","author":"C.E. Brown","year":"2006","unstructured":"Brown, C.E.: Verifying and invalidating textbook proofs using scunak. In: Borwein, J.M., Farmer, W.M. (eds.) MKM 2006. LNCS (LNAI), vol.\u00a04108, pp. 110\u2013123. Springer, Heidelberg (2006)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Calmet, J., Homann, K.: Classification of communication and cooperation mechanisms for logical and symbolic computation systems. In: Frontiers of Combining Systems (FroCos), pp. 221\u2013234 (1996)","DOI":"10.1007\/978-94-009-0349-4_11"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-68103-8_5","volume-title":"Types for Proofs and Programs","author":"P. Corbineau","year":"2007","unstructured":"Corbineau, P.: A declarative language for the Coq proof assistant. In: Miculan, M., Scagnetto, I., Honsell, F. (eds.) TYPES 2007. LNCS, vol.\u00a04941, pp. 69\u201384. Springer, Heidelberg (2007)"},{"key":"9_CR12","series-title":"ENTCS","volume-title":"Proceedings of Logical Frameworks and Meta-Languages (LFM), Copenhagen, Denmark","author":"D. Delahaye","year":"2002","unstructured":"Delahaye, D.: A Proof Dedicated Meta-Language. In: Proceedings of Logical Frameworks and Meta-Languages (LFM), Copenhagen, Denmark, July 2002. ENTCS, vol.\u00a070(2). Elsevier, Amsterdam (2002)"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.entcs.2005.11.025","volume":"151","author":"L.A. Dennis","year":"2006","unstructured":"Dennis, L.A., Jamnik, M., Pollet, M.: On the comparison of proof planning systems: lambda-clam, Omega and IsaPlanner. Electr. Notes Theor. Comput. Sci.\u00a0151(1), 93\u2013110 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1-2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10817-009-9138-5","volume":"44","author":"D. Dietrich","year":"2010","unstructured":"Dietrich, D., Schulz, E.: Crystal: Integrating structured queries into a tactic language. J. Autom. Reasoning\u00a044(1-2), 79\u2013110 (2010)","journal-title":"J. Autom. Reasoning"},{"key":"9_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-85110-3_34","volume-title":"Intelligent Computer Mathematics","author":"D. Dietrich","year":"2008","unstructured":"Dietrich, D., Schulz, E., Wagner, M.: Authoring verified documents by interactive proof construction and verification in text-editors. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC 2008, Calculemus 2008, and MKM 2008. LNCS (LNAI), vol.\u00a05144, pp. 398\u2013414. Springer, Heidelberg (2008)"},{"issue":"4","key":"9_CR16","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.jal.2005.10.007","volume":"4","author":"L. Dixon","year":"2005","unstructured":"Dixon, L., Fleuriot, J.D.: A proof-centric approach to mathematical assistants. J. of Applied Logic: Towards Computer Aided Mathematics Systems\u00a04(4), 505\u2013532 (2005)","journal-title":"J. of Applied Logic: Towards Computer Aided Mathematics Systems"},{"key":"9_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/978-3-540-45085-6_22","volume-title":"Automated Deduction \u2013 CADE-19","author":"L. Dixon","year":"2003","unstructured":"Dixon, L., Fleuriot, J.D.: Isaplanner: A prototype proof planner in Isabelle. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 279\u2013283. Springer, Heidelberg (2003)"},{"key":"9_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-45744-5_33","volume-title":"Automated Reasoning","author":"A. Fiedler","year":"2001","unstructured":"Fiedler, A.: P.rex: An interactive proof explainer. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 416\u2013420. Springer, Heidelberg (2001)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09724-4","volume-title":"Edinburgh LCF \u2013 A mechanised logic of computation","author":"M.J.C. Gordon","year":"1979","unstructured":"Gordon, M.J.C., Milner, R., Wadsworth, C.P.: Edinburgh LCF. LNCS, vol.\u00a078. Springer, Heidelberg (1979)"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/BFb0097791","volume-title":"Types for Proofs and Programs","author":"J. Harrison","year":"1996","unstructured":"Harrison, J.: Proof style. In: Gim\u00e9nez, E., Paulin-Mohring, C. (eds.) TYPES 1996. LNCS, vol.\u00a01512, pp. 154\u2013172. Springer, Heidelberg (1996)"},{"key":"9_CR21","unstructured":"Huang, X.: Human Oriented Proof Presentation: A Reconstructive Approach. DISKI, Infix, Sankt Augustin, Germany, vol.\u00a0112 (1996)"},{"issue":"3-4","key":"9_CR22","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1018980611571","volume":"23","author":"X. Huang","year":"1998","unstructured":"Huang, X., Kerber, M., Cheikhrouhou, L.: Adaptation of declaratively represented methods in proof planning. Annals of Mathematics and Artificial Intelligence\u00a023(3-4), 299\u2013320 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","first-page":"163","volume-title":"Theorem Proving in Higher Order Logics","author":"W.A. Hunt Jr.","year":"2005","unstructured":"Hunt Jr., W.A., Kaufmann, M., Krug, R.B., Moore, J.S., Smith, E.W.: Meta reasoning in ACL2. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 163\u2013178. Springer, Heidelberg (2005)"},{"key":"9_CR24","unstructured":"K\u00fchlwein, D., Cramer, M., Koepke, P., Schr\u00f6der, B.: The naproche system. In: Calculemus 2009, pp. 8\u201318 (July 2009)"},{"key":"9_CR25","series-title":"ENTCS","first-page":"417","volume-title":"Proceedings Fifth International Workshop on Rewriting Logic and its Applications (WRLA 2004)","author":"N. Mart\u00ed-Oliet","year":"2005","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J., Verdejo, A.: Towards a strategy language for Maude. In: Mart\u00ed-Oliet, N. (ed.) Proceedings Fifth International Workshop on Rewriting Logic and its Applications (WRLA 2004), Barcelona, Spain. ENTCS, vol.\u00a0117, pp. 417\u2013441. Elsevier, Amsterdam (2005)"},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0004-3702(99)00076-4","volume":"115","author":"E. Melis","year":"1999","unstructured":"Melis, E., Siekmann, J.H.: Knowledge-based proof planning. Journal Artificial Intelligence\u00a0115(1), 65\u2013105 (1999)","journal-title":"Journal Artificial Intelligence"},{"issue":"1-2","key":"9_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10817-009-9136-7","volume":"44","author":"C. Sacerdoti-Coen","year":"2010","unstructured":"Sacerdoti-Coen, C.: Declarative representation of proof terms. J. Autom. Reasoning\u00a044(1-2), 25\u201352 (2010)","journal-title":"J. Autom. Reasoning"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-48256-3_14","volume-title":"Theorem Proving in Higher Order Logics","author":"D. Syme","year":"1999","unstructured":"Syme, D.: Three tactic theorem proving. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Th\u00e9ry, L. (eds.) TPHOLs 1999. LNCS, vol.\u00a01690, pp. 203\u2013220. Springer, Heidelberg (1999)"},{"key":"9_CR29","volume-title":"Proceedings of the 9th Int. Joint Conference on Artifical Intelligence","author":"A. Trybulec","year":"1985","unstructured":"Trybulec, A., Blair, H.: Computer assisted reasoning with MIZAR. In: Joshi, A. (ed.) Proceedings of the 9th Int. Joint Conference on Artifical Intelligence, M. Kaufmann, San Francisco (1985)"},{"key":"9_CR30","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-73595-3_29","volume-title":"Automated Deduction \u2013 CADE-21","author":"K. Verchinine","year":"2007","unstructured":"Verchinine, K., Lyaletski, A.V., Paskevich, A.: System for automated deduction (SAD): A tool for proof verification. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol.\u00a04603, pp. 398\u2013403. Springer, Heidelberg (2007)"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45127-7_27","volume-title":"Rewriting Techniques and Applications","author":"E. Visser","year":"2001","unstructured":"Visser, E.: Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 357\u2013361. Springer, Heidelberg (2001)"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-48256-3_12","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Wenzel","year":"1999","unstructured":"Wenzel, M.: Isar \u2014 a generic interpretative approach to readable formal proof documents. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Th\u00e9ry, L. (eds.) TPHOLs 1999. LNCS, vol.\u00a01690, pp. 167\u2013184. Springer, Heidelberg (1999)"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-540-24849-1_24","volume-title":"Types for Proofs and Programs","author":"F. Wiedijk","year":"2004","unstructured":"Wiedijk, F.: Formal proof sketches. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol.\u00a03085, pp. 378\u2013393. Springer, Heidelberg (2004)"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-48256-3_13","volume-title":"Theorem Proving in Higher Order Logics","author":"V. Zammit","year":"1999","unstructured":"Zammit, V.: On the implementation of an extensible declarative proof language. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Th\u00e9ry, L. (eds.) TPHOLs 1999. LNCS, vol.\u00a01690, pp. 185\u2013202. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14052-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:17:26Z","timestamp":1619770646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14052-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140518","9783642140525"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14052-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}