Equational logic as a programming language
Equational logic as a programming language
Miranda: a non-strict functional language with polymorphic types
Proc. of a conference on Functional programming languages and computer architecture
Rule-based programming under OPS5
Rule-based programming under OPS5
Comparison of priority rules in pattern matching and term rewriting
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
SIAM Journal on Computing
Journal of the ACM (JACM)
Efficient automata-driven pattern-matching for equational programs
Software—Practice & Experience
Left-to-Right Tree Pattern Matching
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Optimal Left-to-Right Pattern-Matching Automata
ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
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 |
Pattern-matching is a fundamental feature in many applications such as logic programming [5,13], theorem proving [4], term rewriting and rule-based expert systems[3]. Usually, patterns size is not constrained and ambiguous patterns are allowed. This generality leads to a clear and concise programming style. However, it yields challenging problems in the compilation of such programming languages. In this work, we deal with such problems in order to improve time and space requirements of pattern-matching as well as termination properties of term evaluation.