Optimal normalization in orthogonal term rewriting systems

DOI10.1007/978-3-662-21551-7_19OpenAlexW1580910765MaRDI QIDQ5055799

Zurab Khasidashvili

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/978-3-662-21551-7_19

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (max. 100)

The geometry of orthogonal reduction spaces ⋮ Normalisation for higher-order calculi with explicit substitutions ⋮ On the longest perpetual reductions in orthogonal expression reduction systems ⋮ Perpetual reductions in \(\lambda\)-calculus ⋮ Descendants and origins in term rewriting. ⋮ Perpetuality and uniform normalization in orthogonal rewrite systems ⋮ The conflict-free reduction geometry ⋮ Relative normalization in Deterministic Residual Structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A refinement of strong sequentiality for term rewriting with constructors
• Computing in systems described by equations
• Sequentiality in orthogonal term rewriting systems
• Sequential evaluation strategies for parallel-or and related reduction systems
• NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
• Minimal and Optimal Computations of Recursive Programs

This page was built for publication: Optimal normalization in orthogonal term rewriting systems