Convergence in infinitary term graph rewriting systems is simple

DOI10.1017/S0960129518000166zbMATH Open1398.68269OpenAlexW2887986604MaRDI QIDQ4585010FDOQ4585010

Authors: Patrick Bahr 

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

Recommendations

• Modes of convergence for term graph rewriting
• Modes of convergence for term graph rewriting
• scientific article
• Infinitary term graph rewriting is simple, sound and complete
• scientific article; zbMATH DE number 1231494

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Initial Algebra Semantics and Continuous Algebras
• Terminal coalgebras in well-founded set theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Transfinite reductions in orthogonal term rewriting systems
• Title not available (Why is that?)
• Concrete domains
• Skew confluence and the lambda calculus with letrec
• Lambda calculus with explicit recursion
• Modes of convergence for term graph rewriting
• Partial Order Infinitary Term Rewriting
• Processes, Terms and Cycles: Steps on the Road to Infinity

Cited In (4)

• Modes of convergence for term graph rewriting
• Title not available (Why is that?)
• Infinitary term graph rewriting is simple, sound and complete
• Modes of convergence for term graph rewriting

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4585010)