Log In

Generic Matching of Tree Regular Expressions over Haskell Data Types

Files

978-3-319-28228-2_6.pdf (242.85 KB)

Publication date

2016-09-01

Authors

Serrano, AlejandroISNI 0000000434518529
Hage, JurriaanISNI 0000000356203424

Editors

Advisors

Supervisors

DOI

https://doi.org/10.1007/978-3-319-28228-2_6

Document Type

Part of book

Metadata

Show full item record

Collections

Utrecht University Repository
Open Access logo

License

taverne

Abstract

Tree regular expressions are a generalization of string regular expressions to tree-shaped data. In this paper we apply the theory of tree regular expressions to extend pattern matching on Haskell data types. We define the operations in a data type-generic way, looking at data types as fixed-points of pattern functors and using the Generic implementation available in the GHC Haskell compiler.

Keywords

Taverne

Citation

Serrano Mena, A & Hage, J 2016, Generic Matching of Tree Regular Expressions over Haskell Data Types. in Practical Aspects of Declarative Languages : 18th International Symposium, PADL 2016, St. Petersburg, FL, USA, January 18-19, 2016. Proceedings. Lecture Notes in Computer Science, vol. 9585, Springer, pp. 83-98. https://doi.org/10.1007/978-3-319-28228-2_6

URI

https://dspace.library.uu.nl/handle/1874/481216