Abstract
This chapter builds on Chapter 4 and Chapter 5 to describe the combined type inference and parsing procedure needed to interpret and disambiguate mathematics. Although some type-related concepts are used in this chapter, few of the actual technical details from Chapter 5 are needed. In particular, readers need not assimilate the details of the technical presentation of types from §5.4.
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.
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ganesalingam, M. (2013). Typed Parsing. In: The Language of Mathematics. Lecture Notes in Computer Science, vol 7805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37012-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-37012-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37011-3
Online ISBN: 978-3-642-37012-0
eBook Packages: Computer ScienceComputer Science (R0)