Equational Axiomization of Bicoercibility for Polymorphic Types
MetadataShow full item record
CitationTiuryn, Jerzy. "Equational Axiomatization of Bicoercibility for Polymorphic Types“, Technical Report BUCS-1995-004, Computer Science Department, Boston University, February 16, 1995. [Available from: http://hdl.handle.net/2144/1565]
Two polymorphic types σ and τ are said to be bicoercible if there is a coercion from σ to τ and conversely. We give a complete equational axiomatization of bicoercible types and prove that the relation of bicoercibility is decidable.