Abstract
This paper describes a mechanism to generalize mathematical results in type theory based proof assistants. The proposed mechanism starts from a proved theorem or a proved set of theorems (a theory) and makes it possible to get less specific results that can be instantiated and reused in other contexts.
This work was done during a postdoctoral appointment at Universidade do Minho (Portugal). It was supported by the Portuguese Science Foundation (Fundação para a Ciencia e a Technologia) under the Fellowship PRAXIS-XXI/BPD/22108/99.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Aspinall, et al. Proof general 3.0, December 1999. http://www.proofgeneral.org.
B. Barras, et al. The Coq Proof Assistant Reference Manual. INRIA, December 1999. Version 6.3.1.
J. Bertot, et al. User guide to the CtCoq proof environment. Rapport technique RT0210, INRIA, 1997.
O. Boite. Proving type soundness of simply typed ml-like language with references. In Supplementary Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs’2001), September 2001.
G. Barthe and O. Pons. Type Isomorphisms and Proof Reuse in Dependent Type Theory. In F. Honsell and M. Miculan, editors, Proceedings of FOSSACS 2001, LNCS 2030, pages 57–71. Springer, 2001.
R. Constable, et al. Implementing mathematics with the Nuprl proof development system. Prentice-Hall, 1986.
Régis Curien. Outils pour la preuve par analogie. Thèse de doctorat, Universiteé Henri Poincaré, Nancy I, 1995.
J. Denzinger, M. Fuchs, C. Goller, and S. Schul. Learning from previous proof experience: a survey. Technical report, Technischen Universität München, 1999.
A. Felty and D. Howe. Generalization and reuse of tactic proofs. LNCS 822, 1–15, 1994.
R. Hasker and U. Reddy. Generalization at higher types. In D. Miller, editor, Proceedings of the Workshop on the λProlog Programming Language, pages 257–271, Philadelphia, Pennsylvania, July 1992. University of Pennsylvania. Available as Technical Report MS-CIS-92-86.
T. Kolbe and C. Walther. Reusing proofs. In Proc. of the 11th ECAI, pages 80–84, Amsterdam, The Netherlands, 1994.
T. Kolbe and C. Walther. Patching proofs for reuse. In N. Lavrac and S. Wrobel, editors, Proceeding of the European Conference on Machine Learning (ECML-95), Springer LNAI 912, pages 303–306. Heraklion, Greece, 1995.
N. Magaud and Y. Bertot. Changement de représentation des structures de données en Coq: le cas des entiers naturels. In JFLA 2001, 2001.
E. Melis. a model of analogy-driven proof-plan construction. In Frank Pfenning, editor, Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 182–189, Montreal, 1995.
E. Melis. AI-techniques in proof planning. In European Conference on Artificial Intelligence, pages 494–498, 1998.
O. Pons, Y. Bertot, and L. Rideau. Notions of dependency in proof assistants. In Electronic Proceedings of “User Interfaces for Theorem Provers 1998 ”, Sophia-Antipolis, France, 1998.
F. Pfenning. Unification and anti-unification in the Calculus of Constructions. In Sixth Annual IEEE Symposium on Logic in Computer Science, pages 74–85, Amsterdam, The Netherlands, July 1991.
G. D. Plotkin. A note on inductive generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence 5, pages 153–163, Edinburgh, 1969. Edinburgh University Press.
W. Reif and K. Stenzel. Reuse of Proofs in Software Verification. In R. Shyamasundar, editor, Foundation of Software Technology and Theoretical Computer Science. Proceedings, Springer LNCS 761, pages 284–293. Bombay, India, 1993.
M. Si. and T. Reps. Program generalization for software reuse: From C to C++. In Proceedings of the Fourth ACM SIGSOFT Symposium on the Foundations of Software Engineering, volume 216 of ACM Software Engineering Notes, pages 135–146, New York, October 16–18 1996. ACM Press.
L. Théry. A certified version of Buchberger’s algorithm. In Automated Deduction (CADE-15), LNAI 1421, Springer-Verlag, July 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pons, O. (2002). Generalization in Type Theory Based Proof Assistants. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R., Pollack, R. (eds) Types for Proofs and Programs. TYPES 2000. Lecture Notes in Computer Science, vol 2277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45842-5_14
Download citation
DOI: https://doi.org/10.1007/3-540-45842-5_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43287-6
Online ISBN: 978-3-540-45842-5
eBook Packages: Springer Book Archive