Finite family developments

DOI10.1007/3-540-62950-5_80zbMATH Open1379.68208OpenAlexW1596473987MaRDI QIDQ4594237FDOQ4594237

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

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (8)

• Perpetuality and uniform normalization in orthogonal rewrite systems
• Title not available (Why is that?)
• Towards a systematic method for proving termination of graph transformation systems
• On the termination of Russell's description elimination algorithm
• Perpetual reductions in \(\lambda\)-calculus
• On the longest perpetual reductions in orthogonal expression reduction systems
• A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property
• Descendants and origins in term rewriting.

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)