Embedded pattern matching

Trevor L. McDonell; Joshua D. Meredith; Gabriele Keller

doi:10.1145/3546189.3549917

Embedded pattern matching

Trevor L. McDonell, Joshua D. Meredith, Gabriele Keller

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

Haskell is a popular choice for hosting deeply embedded languages. A recurring challenge for these embeddings is how to seamlessly integrate user defined algebraic data types. In particular, one important, convenient, and expressive feature for creating and inspecting data—pattern matching—is not directly available on embedded terms. We present a novel technique, embedded pattern matching, which enables a natural and user friendly embedding of user defined algebraic data types into the embedded language, and allows programmers to pattern match on terms in the embedded language in much the same way they would in the host language.

Original language	English
Title of host publication	Haskell 2022: Proceedings of the 15th ACM SIGPLAN International Haskell Symposium
Publisher	Association for Computing Machinery
Pages	123-136
Number of pages	14
ISBN (Print)	978-1-4503-9438
DOIs	https://doi.org/10.1145/3546189.3549917
Publication status	Published - 2022

Bibliographical note

DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

Keywords

Haskell
pattern matching
algebraic data types
embedded languages

Access to Document

10.1145/3546189.3549917Licence: Taverne

Cite this

@inproceedings{c9cbce3c14ed4f76842f51e299a4d1b3,

title = "Embedded pattern matching",

abstract = "Haskell is a popular choice for hosting deeply embedded languages. A recurring challenge for these embeddings is how to seamlessly integrate user defined algebraic data types. In particular, one important, convenient, and expressive feature for creating and inspecting data—pattern matching—is not directly available on embedded terms. We present a novel technique, embedded pattern matching, which enables a natural and user friendly embedding of user defined algebraic data types into the embedded language, and allows programmers to pattern match on terms in the embedded language in much the same way they would in the host language.",

keywords = "Haskell, pattern matching, algebraic data types, embedded languages",

author = "McDonell, {Trevor L.} and Meredith, {Joshua D.} and Gabriele Keller",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2022",

doi = "10.1145/3546189.3549917",

language = "English",

isbn = "978-1-4503-9438",

pages = "123--136",

booktitle = "Haskell 2022: Proceedings of the 15th ACM SIGPLAN International Haskell Symposium",

publisher = "Association for Computing Machinery",

address = "United States",

}

TY - GEN

T1 - Embedded pattern matching

AU - McDonell, Trevor L.

AU - Meredith, Joshua D.

AU - Keller, Gabriele

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2022

Y1 - 2022

N2 - Haskell is a popular choice for hosting deeply embedded languages. A recurring challenge for these embeddings is how to seamlessly integrate user defined algebraic data types. In particular, one important, convenient, and expressive feature for creating and inspecting data—pattern matching—is not directly available on embedded terms. We present a novel technique, embedded pattern matching, which enables a natural and user friendly embedding of user defined algebraic data types into the embedded language, and allows programmers to pattern match on terms in the embedded language in much the same way they would in the host language.

AB - Haskell is a popular choice for hosting deeply embedded languages. A recurring challenge for these embeddings is how to seamlessly integrate user defined algebraic data types. In particular, one important, convenient, and expressive feature for creating and inspecting data—pattern matching—is not directly available on embedded terms. We present a novel technique, embedded pattern matching, which enables a natural and user friendly embedding of user defined algebraic data types into the embedded language, and allows programmers to pattern match on terms in the embedded language in much the same way they would in the host language.

KW - Haskell

KW - pattern matching

KW - algebraic data types

KW - embedded languages

U2 - 10.1145/3546189.3549917

DO - 10.1145/3546189.3549917

M3 - Conference contribution

SN - 978-1-4503-9438

SP - 123

EP - 136

BT - Haskell 2022: Proceedings of the 15th ACM SIGPLAN International Haskell Symposium

PB - Association for Computing Machinery

ER -

Embedded pattern matching

Abstract

Bibliographical note

Keywords

Access to Document

Fingerprint

Cite this