Work

Type-safe pattern combinators

Year: 2008
Type: article
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.
Language: English
Subfield: Software
Open Access status: bronze
OpenAlex ID: W2155480936
FWCI: 1.987
Cites: 10
Cited by: 14
Related to: 10