Abstract
Computerizing mathematical texts to allow software access to some or all of the texts’ semantic content is a long and tedious process that currently requires much expertise. We believe it is useful to support computerization that adds some structural and semantic information, but does not require jumping directly from the word-processing level (e.g., LATEX) to full formalization (e.g., Mizar, Coq, etc.). Although some existing mathematical languages are aimed at this middle ground (e.g., MathML, OpenMath, OMDoc), we believe they miss features needed to capture some important aspects of mathematical texts, especially the portion written with natural language. For this reason, we have been developing MathLang, a language for representing mathematical texts that has weak type checking and support for the special mathematical use of natural language. MathLang is currently aimed at only capturing the essential grammatical and binding structure of mathematical text without requiring full formalization.
The development of MathLang is directly driven by experience encoding real mathematical texts. Based on this experience, this paper presents the changes that yield our latest version of MathLang. We have restructured and simplified the core of the language, replaced our old notion of “context” by a new system of blocks and local scoping, and made other changes. Furthermore, we have enhanced our support for the mathematical use of nouns and adjectives with object-oriented features so that nouns now correspond to classes, and adjectives to mixins.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
Bourbaki, N.: Elements of Mathematics - Algebra, vol. II. Hermann, Paris (1974)
Bracha, G., Lindstrom, G.: Modularity meets inheritance. In: Proc. Int’l Conf. Computer Languages, pp. 282–290 (1992)
de Bruijn, N.G.: The mathematical language Automath, its usage, and some of its extensions. Lecture Notes in Mathematics 125, 29–61 (1970)
de Bruijn, N.G.: The mathematical vernacular, a language for mathematics with typed sets. In: Workshop on Programming Logic (1987)
Flatt, M., Krishnamurthi, S., Felleisen, M.: Classes and mixins. In: POPL 1998, pp. 171–183 (1998)
Heath: The 13 Books of Euclid’s Elements. Dover, New York (1956)
Jojgov, G., Nederpelt, R.: A path to faithful formalizations of mathematics. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 145–159. Springer, Heidelberg (2004)
Jojgov, G., Nederpelt, R., Scheffer, M.: Faithfully reflecting the structure of informal mathematical proofs into formal type theories. In: MKM Symposium 2003. ENTCS, vol. 93, pp. 102–117 (2004)
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)
Kamareddine, F., Maarek, M., Wells, J.B.: MathLang: Experience-driven development of a new mathematical language. In: MKM Symposium 2003. ENTCS, vol. 93, pp. 138–160 (2004)
Kamareddine, F., Nederpelt, R.: A refinement of de Bruijn’s formal language of mathematics. Journal of Logic, Language and Information 13(3), 287–340 (2004)
Kohlhase, M.: Semantic markup for TeX/LaTeX. Mathematical User-Interfaces Workshop (2004)
Landau, E.: Foundations of Analysis. Chelsea, New York (1951)
Prevosto, V., Doligez, D., Hardin, T.: Algebraic structure and dependent records. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol. 2410, pp. 298–313. Springer, Heidelberg (2002)
Scheffer, M.: Formalizing Mathematics using Weak Type Theory. Master’s thesis, Technische Universiteit Eindhoven (2003)
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
Kamareddine, F., Maarek, M., Wells, J.B. (2006). Toward an Object-Oriented Structure for Mathematical Text. 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_15
Download citation
DOI: https://doi.org/10.1007/11618027_15
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)