SEMIUNIFICATION OF 2 TERMS IN ABELIAN-GROUPS

被引：2
|
作者：
RITTRI, M
机构：
[1] Department of Computing Science, Chalmers University of Technology
来源：
INFORMATION PROCESSING LETTERS | 1994年 / 52卷 / 02期
关键词：
ALGORITHMS; ABELIAN GROUPS; EQUATIONAL SEMIUNIFICATION; PROGRAMMING LANGUAGES; COMPILERS; DIMENSION TYPES; POLYMORPHIC RECURSION;
D O I：
10.1016/0020-0190(94)00127-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A substitution sigma AG-semi-unifies the inequation s less than or equal to(AG)(?) t iff there is another substitution rho such that rho(sigma(s)) =(AG) sigma(t), where =(AG) is equality in Abelian groups. We give an algorithm that decides if an equation has an AG-semi-unifer and, if so, returns a most general one. This is a first step towards type derivation in programming languages with dimension types and polymorphic recursion.
引用
收藏
页码：61 / 68
页数：8
相关论文
共 50 条
12345