Abstract
Functorially polymorphic terms such as map (defined in Chap. 4) require additional type machinery to support them. Type matching is used to choose the correct term for the type of the argument, while the overall type of map requires a type application F X to describe an arbitrary structure (or functor) F containing data of type X.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jay, B. (2009). Functor Polymorphism. In: Pattern Calculus. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89185-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-89185-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89184-0
Online ISBN: 978-3-540-89185-7
eBook Packages: Computer ScienceComputer Science (R0)