(Enter summary)
Abstract: A notation is given for describing the inverse of multiple functions
and of functions of multiple arguments. A technique based upon
this notation is presented for taking a program written in pure LISP
and automatically deriving a program which computes the inverse
function of the given program. This technique di#ers from previous
such methods in its use of heuristics to invert conditionals.
# x)
2
= x rather than
LISP
append
reverse as given in [2], unary
add1 and sub1, and sev-
1.... (Update)
Context of citations to this paper: More
...such as intermixing jumps. An initial attempt at automatically generating symbolic inverses of reversible functions is made in [Eppstein 1985], but it relies on heuristics for correctness. A more theoretical approach is taken in [Chen and Udding 1990] by using inversion of...
.... decoding) Interestingly, inversion has spanned relatively little interest in the area of functional programming (exceptions are [5, 9, 18, 20, 21, 25]) even though it is an essential concept in mathematics. We distinguish between two approaches for solving inversion problems:...
Cited by: More
A Program Inverter for a Functional Language with Equality and .. - Glück, Kawabe (2003)
(Correct)
The Universal Resolving Algorithm: Inverse Computation in a.. - Abramov, Glück (2000)
(Correct)
Efficient Optimistic Parallel Simulations Using Reverse .. - Carothers, Perumalla.. (2000)
(Correct)
Active bibliography (related documents): More All
0.6: Running Programs Backwards: the Logical Inversion of Imperative - Ross (2003)
(Correct)
0.6: Running Programs Backwards: The Logical Inversion of Imperative.. - Ross (1998)
(Correct)
0.3: Transforming Interpreters into Inverse Interpreters by.. - Glück, Kawada, al. (2003)
(Correct)
Similar documents based on text: More All
0.2: Reasoning about Shared Mutable Data Structure - Reynolds, O'Hearn (2001)
(Correct)
0.0: Reduction of bus transitions with Partial Bus-Invert Coding - Shin, Chae, Choi (1998)
(Correct)
0.0: Tense in Simple Conditionals - Crouch (1993)
(Correct)
Related documents from co-citation: More All
2: Program transformation with metasystem transitions (context) - Turchin - 1993
2: Program inversion: more than fun (context) - Chen, Udding - 1990
2: InvX: An automatic function inverter (context) - Khoshnevisan, Sephton
BibTeX entry: (Update)
Eppstein, D. 1985. A heuristic approach to program inversion. In Proceedings of the 9 th International Joint Conference on Articial Intelligence, 219-221. http://citeseer.ist.psu.edu/eppstein85heuristic.html More
@inproceedings{ eppstein85heuristic,
author = "David Eppstein",
title = "A Heuristic Approach to Program Inversion",
booktitle = "{IJCAI}",
pages = "219-221",
year = "1985",
url = "citeseer.ist.psu.edu/eppstein85heuristic.html" }
Citations (may not include all citations):
9
Inversion of applicative programs (context) - Richard - 1981
7
Expression procedures and program derivation (context) - Scherlis - 1980
6
The inversion of functions defined by Turing Machines (context) - John - 1956
5
Program inversion (context) - Dijkstra - 1979 ACM DBLP
3
Invertibility of Logic Programs (context) - Sharon - 1979
1
Knowledge inversion (context) - Yoav - 1984
Documents on the same site (http://www.ics.uci.edu/~eppstein/pubs/all.html): More
Linear Complexity Hexahedral Mesh Generation - Eppstein (1996)
(Correct)
Ununfoldable Polyhedra - Bern, Demaine, Eppstein, Kuo (1999)
(Correct)
Parametric and Kinetic Minimum Spanning Trees - Agarwal, Eppstein, Guibas.. (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC