摘要
We survey fundamental concepts for inverse programming and then present the Universal Resolving Algorithm, an algorithm for inverse computation in a first order, functional programming language. We discuss the key concepts of the algorithm, including a three step approach based on the notion of a perfect process tree, and demonstrate our implementation with several examples of inverse computation.
We survey fundamental concepts for inverse programming and then present the Universal Resolving Algorithm, an algorithm for inverse computation in a first order, functional programming language. We discuss the key concepts of the algorithm, including a three step approach based on the notion of a perfect process tree, and demonstrate our implementation with several examples of inverse computation.