正则置换集:一种控制E-统一的方法
Regular Substitution Sets: A Means of Controlling E-Unification
摘要:
提出了一种在缩窄过程中选择解构造函数的方法。该方法是基于一个排序的纪律,描述了地面建设者的条款作为排序规则集。它被扩展到应付地面替换的定期设置,从而允许不同的排序来计算不同的变量绑定的条款。给出了一种计算等式定义函数签名的算法,该算法允许潜在的无限重载。正式的程序开发的应用勾勒。
英文摘要:
A method for selecting solution constructors in narrowing is presented. The method is based on a sort discipline that describes regular sets of ground constructor terms as sorts. It is extended to cope with regular sets of ground substitutions, thus allowing different sorts to be computed for terms with different variable bindings. An algorithm for computing signatures of equationally defined functions is given that allows potentially infinite overloading. Applications to formal program development are sketched.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。