Ensuring the quasi-termination of needed narrowing computations

Authors:
J. Guadalupe Ramos;Josep Silva;Germán Vidal
Affiliations:
I.T. La Piedad, Av. Tecnológico 2000, La Piedad, Mich., México;DSIC, U. Politécnica de Valencia, Camino de Vera s/n, 46022 Valencia, Spain;DSIC, U. Politécnica de Valencia, Camino de Vera s/n, 46022 Valencia, Spain
Venue:
Information Processing Letters
Year:
2007

Citing 12
Cited 0

Termination of rewriting

Journal of Symbolic Computation
Deforestation: transforming programs to eliminate trees

Proceedings of the Second European Symposium on Programming
Kernel-LEAF: a logic plus functional language

Journal of Computer and System Sciences
Logic programming with functions and predicates: the language Babel

Journal of 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)
A needed narrowing strategy

Journal of the ACM (JACM)
Finiteness Analysis

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
A Demand Driven Computation Strategy for Lazy Narrowing

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

Proceedings of the Third 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

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a characterization of first-order functional programs which are quasi-terminating with respect to the symbolic execution mechanism of needed narrowing, i.e., computations in these programs consist of a sequence of finitely many different function calls (up to variable renaming). Quasi-terminating programs are particularly useful for program analysis and transformation, since in this context quasi-termination often amounts to full termination.