Pattern-matching algorithms based on term rewrite systems

DOI10.1016/S0304-3975(00)00041-4MaRDI QIDQ1575262zbMATH OpenOpenAlexFDO

Authors Joost-Pieter Katoen, Albert Nymeyer

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, https://ris.utwente.nl/ws/files/6642520/sdarticle.pdf

zbMATH Keywords

code generationformal techniquespattern matchingterm rewrite systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES
• scientific article; zbMATH DE number 1949659
• scientific article; zbMATH DE number 2043417
• More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
• scientific article; zbMATH DE number 1497852

Cites work

• Bottom-up tree acceptors
• Code generation based on formal BURS theory and heuristic search
• Code selection by inversion of order-sorted derivors
• Computing in systems described by equations
• Extensions and comparison of simplification orderings
• scientific article; zbMATH DE number 3930339 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 794240 (Why is no real title available?)
• Simple termination of rewrite systems
• Termination of rewriting

Cited in

(2)

• Code generation based on formal BURS theory and heuristic search
• PATTERN MATCHING CODE MINIMIZATION IN REWRITING-BASED PROGRAMMING LANGUAGES

This page was built for publication: Pattern-matching algorithms based on term rewrite systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575262)