Abstract
Mathematical notation has the characteristic of being ambiguous: operators can be overloaded and information that can be deduced is often omitted. Mathematicians are used to this ambiguity and can easily disambiguate a formula making use of the context and of their ability to find the right interpretation.
Software applications that have to deal with formulae usually avoid these issues by fixing an unambiguous input notation. This solution is annoying for mathematicians because of the resulting tricky syntaxes and becomes a show stopper to the simultaneous adoption of tools characterized by different input languages.
In this paper we present an efficient algorithm suitable for ambiguous parsing of mathematical formulae. The only requirement of the algorithm is the existence of a “validity” predicate over abstract syntax trees of incomplete formulae with placeholders. This requirement can be easily fulfilled in the applicative area of interactive proof assistants, and in several other areas of Mathematical Knowledge Management.
The authors have been partially supported by ‘MoWGLI: Math on the Web, Get it by Logic and Interfaces’, EU IST-2001-33562.
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
Asperti, A., Guidi, F., Padovani, L., Sacerdoti Coen, C., Schena, I.: Mathematical Knowledge Management in HELM. Annals of Mathematics and Artificial Intelligence 38(1), 27–46 (2003)
Bancerek, G., Rudnicki, P.: Information Retrieval in MML. In: Asperti, A., Buchberger, B., Davenport, J.H. (eds.) MKM 2003. LNCS, vol. 2594. Springer, Heidelberg (2003)
The Coq proof-assistant, http://coq.inria.fr
Di Lena, P.: Generazione automatica di stylesheet per notazione matematica. Master thesis. University of Bologna (2003)
Guidi, F., Sacerdoti Coen, C.: Querying Distributed Digital Libraries of Mathematics. In: Proceedings of Calculemus 2003, 11th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning. Aracne Editrice (2003)
Kohlhase, M.: OMDoc: An Open Markup Format for Mathematical Documents (Version 1.1). OMDoc technical recommendation
McBride, C.: Dependently Typed Functional Programs and their Proofs. Ph.D. thesis. University of Edinburgh (1999)
Munoz, C.: A Calculus of Substitutions for Incomplete-Proof Representation in Type Theory. Ph.D. thesis, INRIA (1997)
Naylor, W.A., Watt, S.: Meta Style Sheets for the Conversion of Mathematical Documents into other Forms. In: On-Line Proceedings of the First International Conference on Mathematical Knowledge Management, MKM 2001 (2001), http://www.emis.de/proceedings/MKM2001/
The Mizar proof-assistant, http://mizar.uwb.edu.pl/
Ranta, A.: Grammatical Framework: A Type-Theoretical Grammar Formalism. Journal of Functional Programming (manuscript made available in September 2002) (to appear, 2002)
Sacerdoti Coen, C.: Knowledge Management of Formal Mathematics and Interactive Theorem Proving. Ph.D. thesis, University of Bologna (2004)
Strecker, M.: Construction and Deduction in Type Theories. Ph.D. thesis, Universität Ulm (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coen, C.S., Zacchiroli, S. (2004). Efficient Ambiguous Parsing of Mathematical Formulae. In: Asperti, A., Bancerek, G., Trybulec, A. (eds) Mathematical Knowledge Management. MKM 2004. Lecture Notes in Computer Science, vol 3119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27818-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-27818-4_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23029-8
Online ISBN: 978-3-540-27818-4
eBook Packages: Springer Book Archive