Rational term rewriting

DOI10.1007/BFB0053548MaRDI QIDQ3839071zbMATH OpenFDO

Authors Andrea Corradini, Fabio Gadducci

Publication date 8 October 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0053548

zbMATH Keywords

infinite parallel rewritingrewriting logic formalism

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Term rewriting in \(\mathrm{CT}_\Sigma \)
• CPO models for infinite term rewriting
• Infinite terms and infinite rewritings
• Rational term rewriting revisited: decidability and confluence
• On finite representations of infinite sequences of terms

Cited in

(9)

• A causal semantics for CCS via rewriting logic
• Context-sensitive rewriting strategies
• Commutative rational term rewriting
• Term-Graph Rewriting Via Explicit Paths
• GETGRATS: a summary of scientific results (with annotated bibliography)
• Categorical rewriting of term-like structures
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• Term rewriting in \(\mathrm{CT}_\Sigma \)
• On equal -terms

This page was built for publication: Rational term rewriting

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