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
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
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
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
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Hi-index | 0.00 |
Pattern matching is essential in many applications such as information retrieval, logic programming, theorem proving, term rewriting and DNA-computing. It usually breaks down into two categories: root and complete pattern matching. Root matching determines whether a subject term is an instance of a pattern in a pattern set while complete matching determines whether a subject term contains a subterm that is an instance of a pattern in a pattern set. For the sake of efficiency, root pattern matching need to be deterministic and lazy. Furthermore, complete pattern matching needs also to be parallel. Unlike root pattern matching, complete matching received little interest from the researchers of the field. In this paper, we present a novel deterministic multi-threaded complete matching method. This method subsumes a deterministic lazy root matching technique that was developped by the authors in previous work. We evaluate the performance of proposed method using theorem-proving and DNA-computing applictions.