Convergence in infinitary term graph rewriting systems is simple

DOI10.1017/S0960129518000166zbMath1398.68269OpenAlexW2887986604MaRDI QIDQ4585010

P. Bähr

Publication date: 5 September 2018

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129518000166

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Concrete domains
• Lambda calculus with explicit recursion
• Skew confluence and the lambda calculus with letrec
• Transfinite reductions in orthogonal term rewriting systems
• Terminal coalgebras in well-founded set theory
• Modes of Convergence for Term Graph Rewriting
• Initial Algebra Semantics and Continuous Algebras
• Partial Order Infinitary Term Rewriting
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: Convergence in infinitary term graph rewriting systems is simple