Compiling pattern matching by term decomposition

Authors:
Laurence Puel;Ascander Suarez
Affiliations:
LIENS URA CNRS 1327, Ecole Normale Supérieure, 45 rue d'Ulm, 75005 Paris FRANCE;Digital Equipment Corporation, Paris Research Laboratory, 85 Av Victor Hugo, 92563 Rueil Malmaison, FRANCE
Venue:
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Year:
1990

Citing 4
Cited 9

Embedding with patterns and associated recursive path ordering

RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
The Definition of Standard ML

The Definition of Standard ML
Implementation of Lazy Pattern Matching Algorithms

ESOP '88 Proceedings of the 2nd European Symposium on Programming
HOPE: An experimental applicative language

LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming

Compiling lazy pattern matching

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Fast parallel implementation of lazy languages—the EQUALS experience

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Fast strictness analysis based on demand propagation

ACM Transactions on Programming Languages and Systems (TOPLAS)
A new look at pattern matching in abstract data types

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Regular expression pattern matching for XML

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term indexing

Handbook of automated reasoning
Regular expression pattern matching for XML

Journal of Functional Programming
EQUALS – a fast parallel implementation of a lazy language

Journal of Functional Programming
Compiling pattern matching to good decision trees

Proceedings of the 2008 ACM SIGPLAN workshop on ML

Quantified Score

Hi-index	0.02

Visualization

Abstract

We present a method for compiling pattern matching on lazy languages based on previous work of Huet and Lévy and, later on, Laville by coding ambiguous linear sets of patterns using “Term Decomposition”, and producing non ambiguous sets over terms with structural constraints on variables. The method can also be applied on strict languages giving a match algorithm with no useless work when such a match exists.