Type-safe pattern combinators

Authors:
Morten Rhiger
Affiliations:
The it university of copenhagen, copenhagen, denmark (e-mail: mir@itu.dk)
Venue:
Journal of Functional Programming
Year:
2009

Citing 7
Cited 3

Views: a way for pattern matching to cohabit with data abstraction

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Statically checkable pattern abstractions

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Growing a Language

Higher-Order and Symbolic Computation
A Semantic Account of Type-Directed Partial Evaluation

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Do we need dependent types?

Journal of Functional Programming
Functional unparsing

Journal of Functional Programming
Encoding types in ML-like languages

Theoretical Computer Science - Mathematical foundations of programming semantics

“little language” project modules

Journal of Functional Programming
Pattern matching for the masses using custom notations

Science of Computer Programming
Open pattern matching for C++

Proceedings of the 12th international conference on Generative programming: concepts & experiences

Quantified Score

Hi-index	0.00

Visualization

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.