Abstract
One of the main application areas of interactive proof assistants is the formalization of mathematical texts. This formalization not only allows mathematical texts to be handled electronically, but also to be checked for correctness. Due to the level of detail required in the formalization, formalized texts eliminate ambiguities that may be present in an informally presented mathematical texts.
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
The Coq Development Team. The Coq Proof Assistant Reference Manual – Version V8 (2004), http://coq.inria.fr/
Geuvers, H., Jojgov, G.: Open Proofs and Open Terms: a Basis for Interactive Logic. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 537–552. Springer, Heidelberg (2002)
Jojgov, G.I.: Incomplete Proofs and Terms and Their Use in Interactive Theorem Proving. PhD thesis, Eindhoven University of Technology (2004)
Kamareddine, F., Nederpelt, R.: A refinement of de Bruijn’s formal language of mathematics. Journal of Logic, Language and Information (2001)
Kamareddine, F., Maarek, M., Wells, J.B.: Mathlang: Experience-driven development of a new mathematical language. In: MKM Symposium 2003. Elsevier, Amsterdam (2003)
Kamareddine, F., Maarek, M., Wells, J.B.: Flexible encoding of mathematics on the computer. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 160–174. Springer, Heidelberg (2004)
McBride, C.: Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh (1999)
Nederpelt, R.: Weak Type Theory: A formal language for mathematics. Technical report, Eindhoven University of Technology (May 2002)
Nederpelt, R.P., Geuvers, J.H., de Vrijer, R.C. (eds.): Selected Papers on Automath. Studies in Logic and Foundations of Mathematics, vol. 133. North Holland, Amsterdam (1994)
Nipkow, T.: Structured Proofs in Isar/HOL. In: Geuvers, H., Wiedijk, F. (eds.) TYPES 2002. LNCS, vol. 2646, pp. 259–278. Springer, Heidelberg (2003)
Paulson, L.: Introduction to Isabelle. Technical report, University of Cambridge (1993)
Ranta, A.: Grammatical Framework: A Type-Theoretical Grammar Formalism. Journal of Functional Programming (2003)
Rudnicki, P.: An overview of the Mizar project. In: Proceedings of the 1992 Workshop on Types for Proofs and Programs (1992), http://www.mizar.org
Thery, L.: Colouring Proofs: A Lightweight Approach to Adding Formal Structure to Proofs. In: Proceedings of User Interfaces for Theorem Provers UITP 2003. ENTCS 103 (2003)
Wenzel, M., Nipkow, T., Paulson, L.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
Wiedijk, F.: Formal Proof Sketches. In: Berardi, S., Coppo, M., Damiani, F. (eds.) TYPES 2003. LNCS, vol. 3085, pp. 378–393. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jojgov, G.I. (2006). Translating a Fragment of Weak Type Theory into Type Theory with Open Terms. In: Kohlhase, M. (eds) Mathematical Knowledge Management. MKM 2005. Lecture Notes in Computer Science(), vol 3863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11618027_26
Download citation
DOI: https://doi.org/10.1007/11618027_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31430-1
Online ISBN: 978-3-540-31431-8
eBook Packages: Computer ScienceComputer Science (R0)