Paper: Computational consequences and partial solutions of a generalized unification problem (at LICS 1989)

Authors: Assaf J. Kfoury Jerzy Tiuryn Pawel Urzyczyn

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

BibTeX

  @InProceedings{KfouryTiurynUrzyczy-Computationalconseq,
    author = 	 {Assaf J. Kfoury and Jerzy Tiuryn and Pawel Urzyczyn},
    title = 	 {Computational consequences and partial solutions of a generalized unification problem },
    booktitle =  {Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science (LICS 1989)},
    year =	 {1989},
    month =	 {June}, 
    pages =      {98--105},
    location =   {Pacific Grove, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }