Termination of narrowing in left-linear constructor systems

Authors:
Germán Vidal
Affiliations:
Technical University of Valencia, Spain
Venue:
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Year:
2008

Citing 28
Cited 1

Termination of rewriting

Journal of Symbolic Computation
Foundations of Equational Logic Programming

Foundations of Equational Logic Programming
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
Term rewriting and all that

Term rewriting and all that
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

Journal of the ACM (JACM)
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
A needed narrowing strategy

Journal of the ACM (JACM)
The narrowing-driven approach to functional logic program specialization

New Generation Computing - Partial evaluation and program transformation
Argument Filtering Transformation

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Narrowing Approximations as an Optimization for Equational Logic Programs

PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Narrowing the Narrowing Space

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Narrowing Directed by a Graph of Terms

RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Optimal Non-deterministic Functional Logic Computations

ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
Canonical Forms and Unification

Proceedings of the 5th Conference on Automated Deduction
Some Termination Criteria for Narrowing and E-Narrowing

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Eliminating Dummy Elimination

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Lazy Narrowing in a Graph Machine

Proceedings of the Second International Conference on Algebraic and Logic Programming
Fast narrowing-driven partial evaluation for inductively sequential programs

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
A rewriting-based inference system for the NRL Protocol analyzer and its meta-logical properties

Theoretical Computer Science - Automated reasoning for security protocol analysis
Type-level Computation Using Narrowing in Ωmega

Electronic Notes in Theoretical Computer Science (ENTCS)
Extra Variables Can Be Eliminated from Functional Logic Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols

Electronic Notes in Theoretical Computer Science (ENTCS)
Improving offline narrowing-driven partial evaluation using size-change graphs

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Automated termination analysis for logic programs by term rewriting

LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Symbolic model checking of infinite-state systems using narrowing

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Overlapping rules and logic variables in functional logic programs

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Goal-directed and relative dependency pairs for proving the termination of narrowing

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and replacing matching with unification. Narrowing has been widely used in different contexts, ranging from theorem proving to language design. Surprisingly, the termination of narrowing has been mostly overlooked. In this paper, we present a new approach for analyzing the termination of narrowing in left-linear constructor systems--a widely accepted class of systems--that allows us to reuse existing methods in the literature on termination of rewriting.