The Universal Resolving Algorithm: Inverse Computation in a Functional Language

Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) introduced in this paper is sound and complete, and computes all solutions, if they exist, in nite time. The algorithm has been implemented for TSG, a typed dialect of S-Graph, and shows some remarkable results for the inverse computation of programs such as pattern matching and the inverse interpretation of While-programs.

• Type: Conference
• Year: 2000
• Where: MPC
• Authors: Sergei M. Abramov, Robert Glück
• Keywords: Inverse Computation, Mathematics, MPC 2000, Rstorder Functional Language, Universal Resolving Algorithm