DocumentCode
2597178
Title
Computational consequences and partial solutions of a generalized unification problem
Author
Kfoury, A.J. ; Tiuryn, J. ; Urzyczyn, P.
Author_Institution
Dept. of Comput. Sci., Boston Univ., MA, USA
fYear
1989
fDate
5-8 Jun 1989
Firstpage
98
Lastpage
105
Abstract
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 of terms in a restricted form of the polymorphic λ-calculus
Keywords
formal logic; computational consequences; first-order unification; generalized unification problem; improved polymorphic type discipline; partial solutions; polymorphic λ-calculus; restricted form; semiunification; terms; typability; type-checking functional programs; Computer science; Equations; Functional programming; Logic; Mathematics; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1989. LICS '89, Proceedings., Fourth Annual Symposium on
Conference_Location
Pacific Grove, CA
Print_ISBN
0-8186-1954-6
Type
conf
DOI
10.1109/LICS.1989.39163
Filename
39163
Link To Document