Partial Order Infinitary Term Rewriting

DOI10.2168/LMCS-10(2:6)2014zbMath1290.68066arXiv1403.5644WikidataQ58061590 ScholiaQ58061590MaRDI QIDQ5419490

P. Bähr

Publication date: 10 June 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.5644

zbMATH Keywords

partial orderconfluencenormalisationBöhm treesinfinitary term rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Convergence in infinitary term graph rewriting systems is simple ⋮ Unnamed Item

This page was built for publication: Partial Order Infinitary Term Rewriting