Statically Checkable Pattern Abstractions (1997)
| Venue: | In 2nd ACM Int. Conf. on Functional Programming |
| Citations: | 13 - 0 self |
BibTeX
@INPROCEEDINGS{Fähndrich97staticallycheckable,
author = {Manuel Fähndrich and John Boyland},
title = {Statically Checkable Pattern Abstractions},
booktitle = {In 2nd ACM Int. Conf. on Functional Programming},
year = {1997},
pages = {75--84},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Pattern abstractions increase the expressiveness of pattern matching, enabling the programmer to describe a broader class of regular forests with patterns. Furthermore, pattern abstractions support code reuse and code factoring, features that facilitate maintenance and evolution of code. Past research on pattern abstractions has generally ignored the aspect of compile-time checks for exhaustiveness and redundancy. In this paper we propose a class of expressive patterns that admits these compile-time checks.
