article

How to prove equivalence of term rewriting systems without induction

Author:

Yoshihito ToyamaAuthors Info & Claims

Theoretical Computer Science, Volume 90, Issue 2

Pages 369 - 390

Published: 01 November 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Shiraishi TKikuchi KAoto T(2021)A Proof Method for Local Sufficient Completeness of Term Rewriting SystemsTheoretical Aspects of Computing – ICTAC 202110.1007/978-3-030-85315-0_22(386-404)Online publication date: 6-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-85315-0_22
Kikuchi KAoto T(2020)Confluence and Commutation for Nominal Rewriting Systems with Atom-VariablesLogic-Based Program Synthesis and Transformation10.1007/978-3-030-68446-4_3(56-73)Online publication date: 7-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-68446-4_3
Kikuchi KAoto TSasano IKomendantskaya E(2019)Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program TransformationProceedings of the 21st International Symposium on Principles and Practice of Declarative Programming10.1145/3354166.3354178(1-14)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1145/3354166.3354178
Show More Cited By

Index Terms

How to prove equivalence of term rewriting systems without induction
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
      1. Rewrite systems

Recommendations

Confluent term rewriting systems
RTA'05: Proceedings of the 16th international conference on Term Rewriting and Applications

The confluence property is one of the most important properties of term rewriting systems, and various sufficient criteria for proving this property have been widely investigated. A necessary and sufficient criterion for confluence of terminating term ...
Conditions for confluence of innermost terminating term rewriting systems

This paper presents a counterexample for the open conjecture whether innermost joinability of all critical pairs ensures confluence of innermost terminating term rewriting systems. We then show that innermost joinability of all normalized instances of ...
Operational termination of conditional term rewriting systems

We describe conditional rewriting by means of an inference system and capture termination as the absence of infinite inference: that is, all proof attempts must either successfully terminate, or they must fail in finite time. We call this notion ...

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 90, Issue 2

Nov. 25, 1991

184 pages

ISSN:0304-3975

Editor:
M. Nivat
Univ. of Paris, Chevilly-Larue, France

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 01 November 1991

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Shiraishi TKikuchi KAoto T(2021)A Proof Method for Local Sufficient Completeness of Term Rewriting SystemsTheoretical Aspects of Computing – ICTAC 202110.1007/978-3-030-85315-0_22(386-404)Online publication date: 6-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-85315-0_22
Kikuchi KAoto T(2020)Confluence and Commutation for Nominal Rewriting Systems with Atom-VariablesLogic-Based Program Synthesis and Transformation10.1007/978-3-030-68446-4_3(56-73)Online publication date: 7-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-68446-4_3
Kikuchi KAoto TSasano IKomendantskaya E(2019)Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program TransformationProceedings of the 21st International Symposium on Principles and Practice of Declarative Programming10.1145/3354166.3354178(1-14)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1145/3354166.3354178
Nishida NSakai M(2009)Completion after Program Inversion of Injective FunctionsElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2009.03.034237(39-56)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1016/j.entcs.2009.03.034
Aoto T(2006)Dealing with non-orientable equations in rewriting inductionProceedings of the 17th international conference on Term Rewriting and Applications10.1007/11805618_18(242-256)Online publication date: 12-Aug-2006
https://dl.acm.org/doi/10.1007/11805618_18
Chiba YAoto TToyama YBarahona PFelty A(2005)Program transformation by templates based on term rewritingProceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming10.1145/1069774.1069780(59-69)Online publication date: 11-Jul-2005
https://dl.acm.org/doi/10.1145/1069774.1069780

Abstract

Cited By

Index Terms

Recommendations

Confluent term rewriting systems

Conditions for confluence of innermost terminating term rewriting systems

Operational termination of conditional term rewriting systems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations