Type-safe pattern combinators

Morten Rhiger

doi:10.1017/S0956796808007089

Type-safe pattern combinators

Morten Rhiger

Publikation: Artikel i tidsskrift og konference artikel i tidsskrift › Tidsskriftartikel › Forskning › peer review

Abstract

Udgivelsesdato: March 2009

Originalsprog	Engelsk
Tidsskrift	Journal of Functional Programming
Vol/bind	19
Udgave nummer	02
Sider (fra-til)	145-156
ISSN	0956-7968
DOI	https://doi.org/10.1017/S0956796808007089
Status	Udgivet - 2009

Emneord

Typed Higher-Order Programming
Type Systems
Haskell
Pattern Matching
Type-Safe Encoding

Adgang til dokumentet

10.1017/S0956796808007089

ESP: Designing Evolvable Software Products
Dittrich, Y. (PI), Sestoft, P. (CoI), Unphon, H. (CoI), Vaucouleur, S. (CoI) & Rhiger, M. (CoI)
Ministry of Higher Education and Science
01/07/2006 → 30/06/2008
Projekter: Projekt › Forskning

Citationsformater

@article{2ce0c9705cc711de8664000ea68e967b,

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. ",

keywords = "Typed Higher-Order Programming, Type Systems, Haskell, Pattern Matching, Type-Safe Encoding, Typed Higher-Order Programming, Type Systems, Haskell, Pattern Matching, Type-Safe Encoding",

author = "Morten Rhiger",

year = "2009",

doi = "10.1017/S0956796808007089",

language = "English",

volume = "19",

pages = "145--156",

journal = "Journal of Functional Programming",

issn = "0956-7968",

publisher = "Cambridge University Press",

number = "02",

}

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.

KW - Typed Higher-Order Programming

KW - Type Systems

KW - Haskell

KW - Pattern Matching

KW - Type-Safe Encoding

KW - Typed Higher-Order Programming

KW - Type Systems

KW - Haskell

KW - Pattern Matching

KW - Type-Safe Encoding

U2 - 10.1017/S0956796808007089

DO - 10.1017/S0956796808007089

M3 - Journal article

SN - 0956-7968

VL - 19

SP - 145

EP - 156

JO - Journal of Functional Programming

JF - Journal of Functional Programming

IS - 02

ER -

Type-safe pattern combinators

Abstract

Emneord

Adgang til dokumentet

Fingeraftryk

Projekter

ESP: Designing Evolvable Software Products

Citationsformater