Pattern-matching algorithms based on term rewrite systems

DOI10.1016/S0304-3975(00)00041-4zbMath0944.68079OpenAlexW1990794762MaRDI QIDQ1575262

Albert Nymeyer, Joost-Pieter Katoen

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00041-4

zbMATH Keywords

formal techniquespattern matchingcode generationterm rewrite systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Code selection by inversion of order-sorted derivors
• Termination of rewriting
• Computing in systems described by equations
• Bottom-up tree acceptors
• Simple termination of rewrite systems
• Code generation based on formal BURS theory and heuristic search
• Extensions and comparison of simplification orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item