Abstract. We present a method for automatic program inversion in a first-order functional programming language. We formalize the transfor-mation and illustrate it with several examples including the automatic derivation of a program for run-length decoding from a program for run-length encoding. This derivation is not possible with other automatic program inversion methods. One of our key observations is that the du-plication of values and testing of their equality are two sides of the same coin in program inversion. This leads us to the design of a new self-inverse primitive function that considerably simplifies the automatic inversion of programs.
We study the problem to transform functional programs, which intensively use append functions (like ...
Given a constructor term rewriting system that defines injective functions, the inversion compiler p...
AbstractWe investigate various equivalence relations between expressions in a first-order functional...
Abstract. We introduce a new partial inversion technique for first-order functional programs. Our te...
Abstract. Program inversion has many applications such as in the im-plementation of serialization/de...
Abstract. Program inversion has many applications such as in the im-plementation of serialization/de...
AbstractWe introduce proof rules for inverting a program. We derive an algorithm to compute the preo...
In this paper, we continue the work on the formal approach to program inversion by presenting progra...
Different languages provide control structures with different kinds of flexibility. For example, CLU...
We show that reverse-mode AD (Automatic Differentiation)—a generalized gradient-calculation operator...
Program inversion is a fundamental problem that has been addressed in many different programming set...
AbstractWe present an algorithm for inverse computation in a first-order functional language based o...
We show that reverse-mode AD (Automatic Differentiation)—a generalized gradient-calculation operato...
Abstract. We present an algorithm for inverse computation in a first-order functional language based...
Abstract. We study the problem to transform functional programs, which intensively use append functi...
We study the problem to transform functional programs, which intensively use append functions (like ...
Given a constructor term rewriting system that defines injective functions, the inversion compiler p...
AbstractWe investigate various equivalence relations between expressions in a first-order functional...
Abstract. We introduce a new partial inversion technique for first-order functional programs. Our te...
Abstract. Program inversion has many applications such as in the im-plementation of serialization/de...
Abstract. Program inversion has many applications such as in the im-plementation of serialization/de...
AbstractWe introduce proof rules for inverting a program. We derive an algorithm to compute the preo...
In this paper, we continue the work on the formal approach to program inversion by presenting progra...
Different languages provide control structures with different kinds of flexibility. For example, CLU...
We show that reverse-mode AD (Automatic Differentiation)—a generalized gradient-calculation operator...
Program inversion is a fundamental problem that has been addressed in many different programming set...
AbstractWe present an algorithm for inverse computation in a first-order functional language based o...
We show that reverse-mode AD (Automatic Differentiation)—a generalized gradient-calculation operato...
Abstract. We present an algorithm for inverse computation in a first-order functional language based...
Abstract. We study the problem to transform functional programs, which intensively use append functi...
We study the problem to transform functional programs, which intensively use append functions (like ...
Given a constructor term rewriting system that defines injective functions, the inversion compiler p...
AbstractWe investigate various equivalence relations between expressions in a first-order functional...