Generic Matching of Tree Regular Expressions over Haskell Data Types

Alejandro Serrano, J. Hage

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationPractical Aspects of Declarative Languages. PADL 2016
PublisherSpringer
Pages83-98
Number of pages16
ISBN (Electronic)9783319282282
ISBN (Print)9783319282275
DOIs
Publication statusPublished - 9 Jan 2016

Publication series

NameLecture Notes in Computer Science
Volume9585
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Generic Matching of Tree Regular Expressions over Haskell Data Types'. Together they form a unique fingerprint.

Cite this