1993
DOI: 10.1007/3-540-57186-8_93
|View full text |Cite
|
Sign up to set email alerts
|

Narrowing approximations as an optimization for equational logic programs

Abstract: Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient methods based on narrowing strategies to solve systems of equations have been devised. In this paper, we formulate a narrowing-based equation solving calculus which makes use of a top-down abstract interpretation strategy to control the branching of the search tree. We define a refined, but still complete, equation solving procedure which allows us … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0
1

Year Published

1993
1993
2010
2010

Publication Types

Select...
5
1
1

Relationship

4
3

Authors

Journals

citations
Cited by 9 publications
(16 citation statements)
references
References 20 publications
0
15
0
1
Order By: Relevance
“…Similar approaches have been presented by Chabin and Réty [16], where narrowing is directed by a graph of terms, and by Alpuente et al [3], where the notion of loop-check is introduced to detect some unsatisfiable equations. Also, Antoy and Ariola [7] introduced a sort of memoization technique for functional logic languages so that, in some cases, a finite representation of an infinite narrowing space can be achieved.…”
Section: Related Workmentioning
confidence: 87%
See 3 more Smart Citations
“…Similar approaches have been presented by Chabin and Réty [16], where narrowing is directed by a graph of terms, and by Alpuente et al [3], where the notion of loop-check is introduced to detect some unsatisfiable equations. Also, Antoy and Ariola [7] introduced a sort of memoization technique for functional logic languages so that, in some cases, a finite representation of an infinite narrowing space can be achieved.…”
Section: Related Workmentioning
confidence: 87%
“…Then, we adapt a simple binding-time analysis (BTA) [44], which is often used in partial evaluation to propagate static (i.e., ground) and dynamic (i.e., possibly non-ground) values through a program, in order to compute an argument filtering that fulfills the first two conditions of Lemma 11 (that, in turn, come from Definition 12 of safe argument filtering). 3. Finally, we construct a graph of functional dependencies (cf.…”
Section: An Algorithm For Computing Safe Argument Filteringsmentioning
confidence: 99%
See 2 more Smart Citations
“…De esta forma, se consigue asegurar la terminación en un mayor número de casos. (Parte de este trabajo fue presentado en [AFRV93a,AFRV93b]. )…”
Section: Resumen De Aportacionesunclassified