Generic Matching of Tree Regular Expressions over Haskell Data Types

A. Serrano Mena, J. Hage

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    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
    Subtitle of host publication18th International Symposium, PADL 2016, St. Petersburg, FL, USA, January 18-19, 2016. Proceedings
    PublisherSpringer
    Pages83-98
    Number of pages16
    Volume9585
    ISBN (Electronic)978-3-319-28228-2
    ISBN (Print)978-3-319-28227-5
    DOIs
    Publication statusPublished - 1 Sept 2016

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer International Publishing
    ISSN (Print)0302-9743

    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