Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Infinitary term graph rewriting is simple, sound and complete

From MaRDI portal
Publication:5111897
Jump to:navigation, search

DOI10.4230/LIPICS.RTA.2012.69zbMATH Open1437.68075MaRDI QIDQ5111897FDOQ5111897


Authors: Patrick Bahr Edit this on Wikidata


Publication date: 27 May 2020





Recommendations

  • Modes of convergence for term graph rewriting
  • Modes of convergence for term graph rewriting
  • Convergence in infinitary term graph rewriting systems is simple
  • scientific article
  • Böhm Reduction in Infinitary Term Graph Rewriting Systems


zbMATH Keywords

metricpartial orderinfinitary rewritinggraph rewritingterm graphs


Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)



Cited In (7)

  • Modes of convergence for term graph rewriting
  • Title not available (Why is that?)
  • Böhm Reduction in Infinitary Term Graph Rewriting Systems
  • Strict ideal completions of the lambda calculus
  • Coinductive foundations of infinitary rewriting and infinitary equational logic
  • Modes of convergence for term graph rewriting
  • Convergence in infinitary term graph rewriting systems is simple





This page was built for publication: Infinitary term graph rewriting is simple, sound and complete

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5111897&oldid=19631623"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 13:30. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki