Statically checkable pattern abstractions

Authors:
Manuel Fähndrich;John Boyland
Affiliations:
Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, CA;Computer Science Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA
Venue:
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Year:
1997

Citing 9
Cited 9

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
The definition of Standard ML

The definition of Standard ML
Pattern-based languages for prototyping of compiler optimizers

Pattern-based languages for prototyping of compiler optimizers
A new look at pattern matching in abstract data types

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Pattern Matching in Trees

Journal of the ACM (JACM)
A Functional Language for the Specification of Complex Tree Transformations

ESOP '88 Proceedings of the 2nd European Symposium on Programming
MK Pattern Match Compilation and Partial Evaluation

Selected Papers from the Internaltional Seminar on Partial Evaluation
Active Patterns

IFL '96 Selected Papers from the 8th International Workshop on Implementation of Functional Languages
Descriptional Composition of Compiler Components

Descriptional Composition of Compiler Components

From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition

Higher-Order and Symbolic Computation
First Class Patterns

PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
JMatch: Iterable Abstract Pattern Matching for Java

PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Strategic Pattern Matching

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
XDuce: A statically typed XML processing language

ACM Transactions on Internet Technology (TOIT)
Regular expression pattern matching for XML

Journal of Functional Programming
Red-black trees in a functional setting

Journal of Functional Programming
Extensible pattern matching via a lightweight language extension

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Type-safe pattern combinators

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pattern abstractions increase the expressiveness of pattern matthing, 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.