The Universal Resolving Algorithm: Inverse Computation in a Functional Language
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
复制标题
通用求解算法：函数语言的逆计算
DOI：
10.1007/10722010_13
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
R. Glück
中科院分区：
文献类型：
--
作者：
Sergei M. Abramov;R. Glück
我们提出了一个算法的逆计算的一阶函数语言的基础上的概念，一个完美的进程树。本文介绍的通用求解算法（URA）是一种完善的算法，它能在有限时间内计算出所有解。该算法已在S-图的一种类型化方言TSG上实现，并在模式匹配、While-程序的逆解释等函数程序的逆计算中取得了显著的效果。
We present an algorithm for inverse computation in a first-order 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 each solution, if it exists, in finite time. The algorithm has been implemented for TSG, a typed dialect of S-Graph, and shows some remarkable results for the inverse computation of functional programs such as pattern matching and the inverse interpretation of While-programs.