Rational term rewriting revisited: decidability and confluence

Authors:
Takahito Aoto;Jeroen Ketema
Affiliations:
RIEC, Tohoku University, Sendai, Japan;Department of Computing, Imperial College London, London, United Kingdom
Venue:
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Year:
2012

Citing 11
Cited 0

On the adequacy of graph rewriting for simulating term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Transfinite reductions in orthogonal term rewriting systems

Information and Computation
Equational term graph rewriting

Fundamenta Informaticae - Special issue on graph transformations
Term rewriting and all that

Term rewriting and all that
Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
Term graph rewriting

Handbook of graph grammars and computing by graph transformation
Computable analysis: an introduction

Computable analysis: an introduction
Rational Rewriting

MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Term Rewriting in CT-Sigma

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Rational Term Rewriting

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Collapsed Tree Rewriting: Completeness, Confluence, and Modularity

CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a variant of rational term rewriting as first introduced by Corradini et al., i.e., we consider rewriting of (infinite) terms with a finite number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.