作者: A.J. Kfoury , J. Tiuryn , P. Urzyczyn
关键词:
摘要: A generalization of first-order unification, called semiunification, is studied with two goals in mind: (1) type-checking functional programs relative to an improved polymorphic type discipline; and (2) deciding the typability terms a restricted form lambda -calculus. >