Type-safe pattern combinators

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

Macros still haven't made their way into typed higher-order programming languages such as Haskell and Standard ML. Therefore, to extend the expressiveness of Haskell or Standard ML, one must express new linguistic features in terms of functions that fit within the static type systems of these languages. This is particularly challenging when introducing features that span across multiple types and that bind variables. We address this challenge by developing, in a step by step manner, mechanisms for encoding patterns and pattern matching in Haskell in a type-safe way.
Macros still haven't made their way into typed higher-order programming languages such as Haskell and Standard ML. Therefore, to extend the expressiveness of Haskell or Standard ML, one must express new linguistic features in terms of functions that fit within the static type systems of these languages. This is particularly challenging when introducing features that span across multiple types and that bind variables. We address this challenge by developing, in a step by step manner, mechanisms for encoding patterns and pattern matching in Haskell in a type-safe way.
LanguageEnglish
JournalJournal of Functional Programming
Volume19
Issue number2
Pages145156
ISSN0956-7968
DOIs
StatePublished - 2009

Cite this

@article{cab2b820156311df9bed000ea68e967b,
title = "Type-safe pattern combinators",
abstract = "Macros still haven't made their way into typed higher-order programming languages such as Haskell and Standard ML. Therefore, to extend the expressiveness of Haskell or Standard ML, one must express new linguistic features in terms of functions that fit within the static type systems of these languages. This is particularly challenging when introducing features that span across multiple types and that bind variables. We address this challenge by developing, in a step by step manner, mechanisms for encoding patterns and pattern matching in Haskell in a type-safe way.",
author = "Morten Rhiger",
year = "2009",
doi = "10.1017/S0956796808007089",
language = "English",
volume = "19",
pages = "145156",
journal = "Journal of Functional Programming",
issn = "0956-7968",
publisher = "Cambridge University Press",
number = "2",

}

Type-safe pattern combinators. / Rhiger, Morten.

In: Journal of Functional Programming, Vol. 19, No. 2, 2009, p. 145156.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - Type-safe pattern combinators

AU - Rhiger,Morten

PY - 2009

Y1 - 2009

N2 - Macros still haven't made their way into typed higher-order programming languages such as Haskell and Standard ML. Therefore, to extend the expressiveness of Haskell or Standard ML, one must express new linguistic features in terms of functions that fit within the static type systems of these languages. This is particularly challenging when introducing features that span across multiple types and that bind variables. We address this challenge by developing, in a step by step manner, mechanisms for encoding patterns and pattern matching in Haskell in a type-safe way.

AB - Macros still haven't made their way into typed higher-order programming languages such as Haskell and Standard ML. Therefore, to extend the expressiveness of Haskell or Standard ML, one must express new linguistic features in terms of functions that fit within the static type systems of these languages. This is particularly challenging when introducing features that span across multiple types and that bind variables. We address this challenge by developing, in a step by step manner, mechanisms for encoding patterns and pattern matching in Haskell in a type-safe way.

U2 - 10.1017/S0956796808007089

DO - 10.1017/S0956796808007089

M3 - Journal article

VL - 19

SP - 145156

JO - Journal of Functional Programming

T2 - Journal of Functional Programming

JF - Journal of Functional Programming

SN - 0956-7968

IS - 2

ER -