Formalizing the Dependency Pair Criterion for Innermost Termination

Rewriting is a framework for reasoning about functional programming. The dependency pair criterion is a well-known mechanism to analyze termination of term rewriting systems. Functional specifications with an operational semantics based on evaluation are related, in the rewriting framework, to the i...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Ariane Alves Almeida, Ayala-Rincon, Mauricio
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 30.10.2019
Subjects
Criteria
Dependence
Functional programming
Reduction
Semantics
Specifications
Online AccessGet full text

Cover

More Information
Summary:Rewriting is a framework for reasoning about functional programming. The dependency pair criterion is a well-known mechanism to analyze termination of term rewriting systems. Functional specifications with an operational semantics based on evaluation are related, in the rewriting framework, to the innermost reduction relation. This paper presents a PVS formalization of the dependency pair criterion for the innermost reduction relation: a term rewriting system is innermost terminating if and only if it is terminating by the dependency pair criterion. The paper also discusses the application of this criterion to check termination of functional specifications.
ISSN:2331-8422