Article

On Proving Termination by Innermost Termination

Author:

Bernhard GramlichAuthors Info & Claims

RTA '96: Proceedings of the 7th International Conference on Rewriting Techniques and Applications

Pages 93 - 107

Published: 27 July 1996 Publication History

Abstract

No abstract available.

Cited By

View all

Contejean ÉPaskevich AUrbain XCourtieu PPons OForest JGallagher JVoigtländer J(2010)A3PAT, an approach for certified automated termination proofsProceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation10.1145/1706356.1706370(63-72)Online publication date: 19-Jan-2010
https://dl.acm.org/doi/10.1145/1706356.1706370
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
Dougherty DKirchner CKirchner HDe Oliveira A(2007)Modular access control via strategic rewritingProceedings of the 12th European conference on Research in Computer Security10.5555/2393847.2393899(578-593)Online publication date: 24-Sep-2007
https://dl.acm.org/doi/10.5555/2393847.2393899
Show More Cited By

On Proving Termination by Innermost Termination
1. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms

Recommendations

Innermost termination of context-sensitive rewriting
DLT'02: Proceedings of the 6th international conference on Developments in language theory

Context-sensitive rewriting is a restriction of term rewriting used to model evaluation strategies in functional programming and in programming languages like OBJ. For example, under certain conditions termination of an OBJ program is equivalent to ...
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting

Computational systems based on reducing expressions usually have a predefined reduction strategy to break down the nondeterminism which is inherent to reduction relations. The innermost strategy corresponds to call by value or eager computation, that is,...
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 ...

Comments

Information & Contributors

Information

Published In

RTA '96: Proceedings of the 7th International Conference on Rewriting Techniques and Applications

July 1996

432 pages

ISBN:3540614648

Editor:
Harald Ganzinger

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 27 July 1996

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
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

Contejean ÉPaskevich AUrbain XCourtieu PPons OForest JGallagher JVoigtländer J(2010)A3PAT, an approach for certified automated termination proofsProceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation10.1145/1706356.1706370(63-72)Online publication date: 19-Jan-2010
https://dl.acm.org/doi/10.1145/1706356.1706370
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
Dougherty DKirchner CKirchner HDe Oliveira A(2007)Modular access control via strategic rewritingProceedings of the 12th European conference on Research in Computer Security10.5555/2393847.2393899(578-593)Online publication date: 24-Sep-2007
https://dl.acm.org/doi/10.5555/2393847.2393899
Gnaedig IKirchner H(2007)Narrowing, abstraction and constraints for proving properties of reduction relationsRewriting Computation and Proof10.5555/2391276.2391280(44-67)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.5555/2391276.2391280
Gnaedig ILeuschel MPodelski A(2007)Induction for positive almost sure terminationProceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming10.1145/1273920.1273943(167-178)Online publication date: 14-Jul-2007
https://dl.acm.org/doi/10.1145/1273920.1273943
Alarcón BLucas S(2007)Termination of Innermost Context-Sensitive Rewriting Using Dependency PairsProceedings of the 6th international symposium on Frontiers of Combining Systems10.1007/978-3-540-74621-8_5(73-87)Online publication date: 10-Sep-2007
https://dl.acm.org/doi/10.1007/978-3-540-74621-8_5
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
Fernández MGodoy GRubio A(2005)Orderings for innermost terminationProceedings of the 16th international conference on Term Rewriting and Applications10.1007/978-3-540-32033-3_3(17-31)Online publication date: 19-Apr-2005
https://dl.acm.org/doi/10.1007/978-3-540-32033-3_3
Amadio R(2003)Max-plus quasi-interpretationsProceedings of the 6th international conference on Typed lambda calculi and applications10.5555/1762348.1762351(31-45)Online publication date: 10-Jun-2003
https://dl.acm.org/doi/10.5555/1762348.1762351
Borovanský PKirchner CKirchner HMoreau P(2002)ELAN from a rewriting logic point of viewTheoretical Computer Science10.1016/S0304-3975(01)00358-9285:2(155-185)Online publication date: 28-Aug-2002
https://dl.acm.org/doi/10.1016/S0304-3975%2801%2900358-9
Show More Cited By

Abstract

Cited By

Recommendations

Innermost termination of context-sensitive rewriting

Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor 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