Comparison of priority rules in pattern matching and term rewriting

DOI10.1016/S0747-7171(08)80109-5zbMATH Open0731.68059MaRDI QIDQ808264FDOQ808264

Alain Laville

Publication date: 1991

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Recommendations

• scientific article
• Implementing first-order rewriting with constructor systems
• Term rewriting systems with sort priorities
• Termination of Priority Rewriting
• scientific article; zbMATH DE number 1708150

zbMATH Keywords

pattern matchingpriority rulesfunction calls

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• More efficient left-to-right matching for overlapping pattern
• Title not available (Why is that?)
• Termination of Priority Rewriting
• Implementing first-order rewriting with constructor systems
• Title not available (Why is that?)
• Operational semantics of rewriting with priorities
• Title not available (Why is that?)
• Lazy rewriting and eager machinery
• Title not available (Why is that?)

Uses Software

• Miranda
• Centaur

This page was built for publication: Comparison of priority rules in pattern matching and term rewriting

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