Show simple item record

dc.contributor.authorTiuryn, Jerzyen_US
dc.date.accessioned2011-10-20T04:32:18Z
dc.date.available2011-10-20T04:32:18Z
dc.date.issued1995-02
dc.identifier.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]
dc.identifier.urihttps://hdl.handle.net/2144/1565
dc.description.abstractTwo 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.en_US
dc.description.sponsorshipNational Science Foundation (CCR-9113196); KBN (2 P301 031 06); ESPRIT BRA7232 GENTZENen_US
dc.language.isoen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-1995-004
dc.titleEquational Axiomization of Bicoercibility for Polymorphic Typesen_US
dc.typeTechnical Reporten_US


This item appears in the following Collection(s)

Show simple item record