Efficient pattern matching for non-strongly sequential term rewriting systems
From MaRDI portal
Recommendations
- More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
- More efficient left-to-right matching for overlapping pattern
- Improving space, time, and termination in rewriting-based programming
- Minimal adaptive pattern-matching automata for efficient term rewriting
- scientific article; zbMATH DE number 1497852
Cited in
(10)- Pattern-matching algorithms based on term rewrite systems
- More efficient left-to-right matching for overlapping pattern
- Improving space, time, and termination in rewriting-based programming
- A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching
- More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
- Minimal adaptive pattern-matching automata for efficient term rewriting
- scientific article; zbMATH DE number 1497852 (Why is no real title available?)
- Adaptive non-linear pattern matching automata
- Optimal adaptive pattern-matching using finite state automata
- Complete pattern matching: Recursivity versus multi-threading
This page was built for publication: Efficient pattern matching for non-strongly sequential term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450893)