Abstract
In languages such as ML or Haskell, you can define data types by specifying functions you will use to construct values of any given type. In itself, that is not that interesting, but combined with a pattern matching feature of these languages, you can write very succinct functions for transforming data structures.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Thomas Mailund
About this chapter
Cite this chapter
Mailund, T. (2018). Pattern Matching. In: Domain-Specific Languages in R. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3588-1_11
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3588-1_11
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3587-4
Online ISBN: 978-1-4842-3588-1
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)