Logic in Computer Science (LICS 1989)

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

Authors: Kfoury, A.J. Tiuryn, J. Urzyczyn, P.

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 = 	 {Kfoury, A.J. and Tiuryn, J. and Urzyczyn, P.},
    title = 	 {Computational consequences and partial solutions of a generalized unification problem },
    booktitle =  {Proceedings of the Fourth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1989},
    year =	 1989,
    editor =	 {Rohit Parikh},
    month =	 {June}, 
    pages =      {98--105},
    location =   {Pacific Grove, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }