An universal resolving algorithm for inverse computation of lazy languages

Authors:
Sergei Abramov;Robert Glück;Yuri Klimov
Affiliations:
Program Systems Institute, Russian Academy of Sciences, Pereslavl-Zalessky, Russia;DIKU, Department of Computer Science, University of Copenhagen, Copenhagen, Denmark;M.V. Keldysh Institute for Applied Mathematics, Russian Academy of Sciences, Moscow, Russia
Venue:
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Year:
2006

Citing 9
Cited 1

The concept of a supercompiler

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Logic programming with functions and predicates: the language Babel

Journal of Logic Programming
From checking to inference via driving and dag grammars

PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
The narrowing-driven approach to functional logic program specialization

New Generation Computing - Partial evaluation and program transformation
Partial Deduction and Driving are Equivalent

PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Program Transformation with Metasystem Transitions: Experiments with a Supercompiler

Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree

WSA '93 Proceedings of the Third International Workshop on Static Analysis
The Universal Resolving Algorithm: Inverse Computation in a Functional Language

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Inverting Functions as Folds

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction

Refactoring pattern matching

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 computation in the context of functional-logic languages.