Normalization of Infinite Terms

DOI10.1007/978-3-540-70590-1_30zbMath1146.68042OpenAlexW1484657764MaRDI QIDQ3522036

Hans Zantema

Publication date: 28 August 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_30

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items

Infinitary rewriting: closure operators, equivalences and models ⋮ Highlights in infinitary rewriting and lambda calculus ⋮ Levels of undecidability in rewriting ⋮ Modularity of Convergence in Infinitary Rewriting ⋮ Proving Infinitary Normalization ⋮ Unnamed Item ⋮ Degrees of Undecidability in Term Rewriting

Cites Work

• Matrix interpretations for proving termination of term rewriting
• Termination of term rewriting: Interpretation and type elimination
• Transfinite reductions in orthogonal term rewriting systems
• Termination of term rewriting using dependency pairs
• On Normalisation of Infinitary Combinatory Reduction Systems
• Matrix Interpretations for Proving Termination of Term Rewriting
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Unnamed Item
• Unnamed Item

This page was built for publication: Normalization of Infinite Terms