article

Natural termination

Authors:

Nachum Dershowitz,

Charles HootAuthors Info & Claims

Theoretical Computer Science, Volume 142, Issue 2

Pages 179 - 207

https://doi.org/10.1016/0304-3975(94)00275-4

Published: 15 May 1995 Publication History

Abstract

No abstract available.

Cited By

View all

Saito THirokawa N(2023)Weighted Path Orders Are Semantic Path OrdersFrontiers of Combining Systems10.1007/978-3-031-43369-6_4(63-80)Online publication date: 20-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43369-6_4
(2015)A unified ordering for termination provingScience of Computer Programming10.1016/j.scico.2014.07.009111:P1(110-134)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1016/j.scico.2014.07.009
Demangeon RHirschkoff DSangiorgi D(2009)Mobile processes and terminationSemantics and algebraic specification10.5555/1809296.1809309(250-273)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.5555/1809296.1809309
Show More Cited By

Index Terms

Natural termination
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations on polynomials
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
      1. Rewrite systems
    2. Grammars and context-free languages

Recommendations

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

Yi and Sakai [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In the 17th International Conference on Rewriting Techniques and Applications, volume 4098 of Lecture Notes in ...
Termination of non-simple rewrite systems
From Outermost Termination to Innermost Termination
SOFSEM '09: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science

Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important technique for program verification. To capture the evaluation mechanism of a programming ...

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 142, Issue 2

May 15, 1995

223 pages

ISSN:0304-3975

Editors:
M. Nivat
Univ. Paris VII, Moiselles, France
,
Claude Kirchner
INRIA-Lorraine, Cedex, France

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 15 May 1995

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Saito THirokawa N(2023)Weighted Path Orders Are Semantic Path OrdersFrontiers of Combining Systems10.1007/978-3-031-43369-6_4(63-80)Online publication date: 20-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43369-6_4
(2015)A unified ordering for termination provingScience of Computer Programming10.1016/j.scico.2014.07.009111:P1(110-134)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1016/j.scico.2014.07.009
Demangeon RHirschkoff DSangiorgi D(2009)Mobile processes and terminationSemantics and algebraic specification10.5555/1809296.1809309(250-273)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.5555/1809296.1809309
Gnaedig IKirchner H(2009)Termination of rewriting under strategiesACM Transactions on Computational Logic10.1145/1462179.146218210:2(1-52)Online publication date: 2-Mar-2009
https://dl.acm.org/doi/10.1145/1462179.1462182
Dershowitz NMoser G(2007)The hydra battle revisitedRewriting Computation and Proof10.5555/2391276.2391278(1-27)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.5555/2391276.2391278
Dawson JGoré R(2007)Termination of abstract reduction systemsProceedings of the thirteenth Australasian symposium on Theory of computing - Volume 6510.5555/1273694.1273699(35-43)Online publication date: 30-Jan-2007
https://dl.acm.org/doi/10.5555/1273694.1273699
Deng YSangiorgi D(2006)Ensuring termination by typabilityInformation and Computation10.1016/j.ic.2006.03.002204:7(1045-1082)Online publication date: 1-Jul-2006
https://dl.acm.org/doi/10.1016/j.ic.2006.03.002
Dershowitz N(2005)Primitive rewritingProcesses, Terms and Cycles10.5555/2168279.2168289(127-147)Online publication date: 1-Jan-2005
https://dl.acm.org/doi/10.5555/2168279.2168289
Dershowitz N(2005)Open. closed. open.Proceedings of the 16th international conference on Term Rewriting and Applications10.1007/978-3-540-32033-3_28(376-393)Online publication date: 19-Apr-2005
https://dl.acm.org/doi/10.1007/978-3-540-32033-3_28
Giesl JMiddeldorp A(2004)Transformation techniques for context-sensitive rewrite systemsJournal of Functional Programming10.1017/S095679680300494514:4(379-427)Online publication date: 1-Jul-2004
https://dl.acm.org/doi/10.1017/S0956796803004945
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

Termination of non-simple rewrite systems

From Outermost Termination to Innermost Termination

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