Incremental techniques for efficient normalization of nonlinear rewrite systems

DOI10.1007/3-540-53904-2_108MaRDI QIDQ5055772zbMATH OpenOpenAlexFDO

Authors

Publication date 9 December 2022

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53904-2_108

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 177827
• A graph reduction approach to incremental term rewriting
• scientific article; zbMATH DE number 4060735
• Nonlinear pattern matching in trees
• More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs

Cites work

• Efficient string matching
• scientific article; zbMATH DE number 4037157 (Why is no real title available?)
• scientific article; zbMATH DE number 4060735 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 125882 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• Incremental techniques for efficient normalization of nonlinear rewrite systems
• Pattern Matching in Trees
• Refutational theorem proving using term-rewriting systems
• Variations on the Common Subexpression Problem

Cited in

(5)

• Non-linear rewrite closure and weak normalization
• scientific article; zbMATH DE number 177827 (Why is no real title available?)
• Incremental techniques for efficient normalization of nonlinear rewrite systems
• A graph reduction approach to incremental term rewriting
• Generating tables for bottom-up matching

This page was built for publication: Incremental techniques for efficient normalization of nonlinear rewrite systems

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