Partial Inversion of Constructor Term Rewriting Systems

Nishida, Naoki; Sakai, Masahiko; Sakabe, Toshiki

doi:10.1007/978-3-540-32033-3_20

Cited by 33 publications

(60 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, we would like to design fully automatic strategies for producing finite extended narrowing trees (e.g., following the methods used in the context of narrowing-driven partial evaluation [1]). We find also interesting the definition of methods to automatically analyze success set equations and infer useful properties that can be used in other contexts (like the more specific transformation mentioned above, that is currently being used for improving program inversion [20,19,21]). …”

Section: Discussionmentioning

confidence: 99%

A Finite Representation of the Narrowing Space

Nishida

Vidal

2014

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract. Narrowing basically extends rewriting by allowing free variables in terms and by replacing matching with unification. As a consequence, the search space of narrowing becomes usually infinite, as in logic programming. In this paper, we introduce the use of some operators that allow one to always produce a finite graph that still represents all the narrowing derivations. Furthermore, we introduce a novel, compact equational representation of the (possibly infinite) answers computed by narrowing for a given initial term. Both the finite graphs and the equational representation of the computed answers might be useful in a number of areas, like program comprehension, static analysis, program transformation, etc.

show abstract

Section: Discussionmentioning

confidence: 99%

A Finite Representation of the Narrowing Space

Nishida

Vidal

2014

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Although there exist several approaches to function inversion in the literature (e.g., [6,8,10,17]), we only found a formal proof of correctness for the transformation in the work of Nishida et al [15].…”

Section: Correctnessmentioning

confidence: 98%

“…As mentioned before, the first condition above is often ignored (e.g., [15]), but we require it in order to produce partially inverted programs which are useful in practice.…”

Section: In This Case We Say That F I Is the Partial Inverse Of F Wmentioning

confidence: 99%

“…Let us first consider the work of Nishida et al [15]. There are two kinds of differences between our method and that of [15]: -Restrictions.…”

Section: Correctnessmentioning

confidence: 99%

“…There are two kinds of differences between our method and that of [15]: -Restrictions. In comparison with [15], we added several new restrictions in order to ensure that the result is "acceptable".…”

Section: Correctnessmentioning

confidence: 99%

See 2 more Smart Citations

Automatic Partial Inversion of Inductively Sequential Functions

Almendros-Jiménez

Vidal

Implementation and Application of Functional Languages

View full text Add to dashboard Cite

Abstract. We introduce a new partial inversion technique for first-order functional programs. Our technique is simple, fully automatic, and (when it succeeds) returns a program that belongs to the same class of the original program, namely the class of inductively sequential programs (i.e., typical functional programs). To ease the definition, our method proceeds in a stepwise manner: normalization (introduction of let expressions), proper inversion, and removal of let expressions. Furthermore, it can easily be implemented. Therefore, it forms an appropriate basis for developing a practically applicable transformation tool. Preliminary experiments with a prototype implementation of the partial inverter demonstrates the usefulness and viability of our approach.

show abstract

Semi-inversion of Conditional Constructor Term Rewriting Systems

Kirkeby¹,

Glück²

2020

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Partial Inversion of Constructor Term Rewriting Systems

Cited by 33 publications

References 17 publications

A Finite Representation of the Narrowing Space

A Finite Representation of the Narrowing Space

Automatic Partial Inversion of Inductively Sequential Functions

Semi-inversion of Conditional Constructor Term Rewriting Systems

Contact Info

Product

Resources

About