article

Higher-order rewrite systems and their confluence

Authors:

Richard Mayr,

Tobias NipkowAuthors Info & Claims

Theoretical Computer Science, Volume 192, Issue 1

Pages 3 - 29

https://doi.org/10.1016/S0304-3975(97)00143-6

Published: 10 February 1998 Publication History

Abstract

No abstract available.

Cited By

View all

Ye KMetere RYadav P(2024)User-Guided Verification of Security Protocols via Sound AnimationSoftware Engineering and Formal Methods10.1007/978-3-031-77382-2_3(33-51)Online publication date: 4-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-77382-2_3
Stübinger THupel L(2024)Extending Isabelle/HOL’s Code Generator with Support for the Go Programming LanguageFormal Methods10.1007/978-3-031-71177-0_1(3-19)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71177-0_1
Niederhauser JBrown CKaliszyk C(2024)Tableaux for Automated Reasoning in Dependently-Typed Higher-Order LogicAutomated Reasoning10.1007/978-3-031-63498-7_6(86-104)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-63498-7_6
Show More Cited By

Index Terms

Higher-order rewrite systems and their confluence

Recommendations

Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems

We investigate restricted termination and confluence properties of term rewriting systems, in particular weak termination, weak innermost termination, (strong) innermost termination, (strong) termination, and their interrelations. New criteria are ...
Confluence Criteria for Logically Constrained Rewrite Systems
Automated Deduction – CADE 29
Abstract
Numerous confluence criteria for plain term rewrite systems are known. For logically constrained rewrite system, an attractive extension of term rewriting in which rules are equipped with logical constraints, much less is known. In this paper we ...
Termination of non-simple rewrite systems

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 192, Issue 1

Special issue: rewriting systems and applications

Feb. 10, 1998

157 pages

ISSN:0304-3975

Editors:
M. Nivat
Univ. de Paris VII, Moiselles, France
,
Jieh Hsiang

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 10 February 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ye KMetere RYadav P(2024)User-Guided Verification of Security Protocols via Sound AnimationSoftware Engineering and Formal Methods10.1007/978-3-031-77382-2_3(33-51)Online publication date: 4-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-77382-2_3
Stübinger THupel L(2024)Extending Isabelle/HOL’s Code Generator with Support for the Go Programming LanguageFormal Methods10.1007/978-3-031-71177-0_1(3-19)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71177-0_1
Niederhauser JBrown CKaliszyk C(2024)Tableaux for Automated Reasoning in Dependently-Typed Higher-Order LogicAutomated Reasoning10.1007/978-3-031-63498-7_6(86-104)Online publication date: 3-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-63498-7_6
Díaz-Caro ADowek GIvnisky MMalherbe O(2024)A Linear Proof Language for Second-Order Intuitionistic Linear LogicLogic, Language, Information, and Computation10.1007/978-3-031-62687-6_2(18-35)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-62687-6_2
Díaz-Caro ADowek G(2023)A new connective in natural deduction, and its application to quantum computingTheoretical Computer Science10.1016/j.tcs.2023.113840957:COnline publication date: 12-May-2023
https://dl.acm.org/doi/10.1016/j.tcs.2023.113840
Bentkamp ABlanchette JTourret SVukmirović P(2023)Superposition for Higher-Order LogicJournal of Automated Reasoning10.1007/s10817-022-09649-967:1Online publication date: 21-Jan-2023
https://dl.acm.org/doi/10.1007/s10817-022-09649-9
Fernández M(2023)Unification Modulo Equational Theories in Languages with Binding Operators (Invited Talk)Logic-Based Program Synthesis and Transformation10.1007/978-3-031-45784-5_1(3-6)Online publication date: 23-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-45784-5_1
Ye KFoster SWoodcock J(2022)Formally Verified Animation for RoboChart Using Interaction TreesFormal Methods and Software Engineering10.1007/978-3-031-17244-1_24(404-420)Online publication date: 24-Oct-2022
https://dl.acm.org/doi/10.1007/978-3-031-17244-1_24
Férey GJouannaud J(2021)Confluence in Non-Left-Linear Untyped Higher-Order Rewrite TheoriesProceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming10.1145/3479394.3479403(1-14)Online publication date: 6-Sep-2021
https://dl.acm.org/doi/10.1145/3479394.3479403
Bentkamp ABlanchette JTourret SVukmirović PWaldmann U(2021)Superposition with LambdasJournal of Automated Reasoning10.1007/s10817-021-09595-y65:7(893-940)Online publication date: 1-Oct-2021
https://dl.acm.org/doi/10.1007/s10817-021-09595-y
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems

Confluence Criteria for Logically Constrained Rewrite Systems

Termination of non-simple rewrite systems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations