Finite family developments

DOI10.1007/3-540-62950-5_80MaRDI QIDQ4594237zbMATH OpenOpenAlexFDO

Authors Vincent van Oostrom

Publication date 17 November 2017

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

Full work available at URL https://doi.org/10.1007/3-540-62950-5_80

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property
• Higher-order families
• Generalized finite developments
• Higher-order rewrite systems and their confluence
• scientific article; zbMATH DE number 1615229

Cited in

(8)

• Perpetual reductions in -calculus
• Descendants and origins in term rewriting.
• Perpetuality and uniform normalization in orthogonal rewrite systems
• On the termination of Russell's description elimination algorithm
• A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property
• scientific article; zbMATH DE number 7204428 (Why is no real title available?)
• Towards a systematic method for proving termination of graph transformation systems
• On the longest perpetual reductions in orthogonal expression reduction systems

This page was built for publication: Finite family developments

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