Title: Equational Axiomatization of Bicoercibility for Polymorphic Types
Author: Jerzy Tiuryn, Institute of Informatics, Warsaw University
Date: February 16, 1995

Abstract: Two polymorphic types \sigma and \tau are said to be bicoercible if
there is a coercion from \sigma to \tau and conversely. We give a
complete equational axiomatization of bicoercible types and prove that the
relation of bicoercibility is decidable.