Transfinite reductions in orthogonal term rewriting systems

DOI10.1007/3-540-53904-2_81zbMath1502.68151OpenAlexW2166184800MaRDI QIDQ5055744

M. R. Sleep, Jan Willem Klop, J. R. Kennaway, Fer-Jan de Vries

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/3-540-53904-2_81

zbMATH Keywords

normal formsBöhm treesinfinitary rewritinghead normal formsinfinite Church-Rosser propertiesnon-unifiable term-rewriting systemsorthogonal term-rewriting systemsstrong converging reductions

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Simple type inference for term graph rewriting systems, Term graph rewriting and garbage collection using opfibrations, Open problems in rewriting, More problems in rewriting, Highlights in infinitary rewriting and lambda calculus, Rewrite, rewrite, rewrite, rewrite, rewrite, \dots, Infinite normal forms for non-linear term rewriting systems, Relating graph and term rewriting via Böhm models

Uses Software

• Haskell
• Miranda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• REDEX CAPTURING IN TERM GRAPH REWRITING
• Tree-Manipulating Systems and Church-Rosser Theorems