Equational Axiomization of Bicoercibility for Polymorphic Types
| Data(s) |
20/10/2011
20/10/2011
01/02/1995
|
|---|---|
| Resumo |
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. National Science Foundation (CCR-9113196); KBN (2 P301 031 06); ESPRIT BRA7232 GENTZEN |
| Identificador |
Tiuryn, 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] |
| Idioma(s) |
en_US |
| Publicador |
Boston University Computer Science Department |
| Relação |
BUCS Technical Reports;BUCS-TR-1995-004 |
| Tipo |
Technical Report |
