An Universal Resolving Algorithm for Inverse Computation of Lazy Languages

@inproceedings{Abramov2006AnUR,
  title={An Universal Resolving Algorithm for Inverse Computation of Lazy Languages},
  author={Sergei M. Abramov and Robert Gl{\"u}ck and Yuri A. Klimov},
  booktitle={Ershov Memorial Conference},
  year={2006}
}
The Universal Resolving Algorithm was originally formulated for inverse computation of tail-recursive programs. We present an extension to general recursion that improves the efficiency and termination of inverse computation because partially produced output is used to reduce the search space. In addition, we present a transformation using a new unification-based equality operator. Examples demonstrate the advantages of the new technique. We found that these extensions can also improve inverse… CONTINUE READING

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS