Lazy pattern matching in the ML language
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
Implementing functional languages in the Categorical Abstract Machine
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Compiling a functional language
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional 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
Generating Decision Trees for Decoding Binaries
OM '01 Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems
Efficient concise deterministic pattern-matching automata for ambiguous patterns
ACM SIGPLAN Notices
Improving Space, Time, and Termination in Rewriting-Based Programming
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Optimal Adaptive Pattern Matching
IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Efficient pattern matching for non-strongly sequential term rewriting systems
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
More efficient left-to-right pattern matching in non-sequential equational programs
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Complete pattern matching: recursivity versus multi-threading
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
| Hi-index | 0.00 |
Programming languages such as ML provide function calls with pattern matching. For each function, there is a given set of patterns for arguments with the corresponding definition of the function. Cases corresponding to different patterns of a given function may not be exclusive, and often a priority rule (typically the order of the program text) is followed to disambiguate overlapping cases. In this paper, term rewriting systems are taken as models for function calls with pattern matching. It is shown that, in the useful set of constructors based linear systems, all priority rules are essentially equivalent. Moreover the translation from one rule to another one may be mechanically done. These results hold both for lazy and eager evaluations.