Phantom Types and Subtyping
| dc.creator | Fluet, Matthew | |
| dc.creator | Pucella, Riccardo | |
| dc.date | 2004-03-23 | |
| dc.date | 2006-01-29 | |
| dc.date.accessioned | 2026-07-07T06:34:57Z | |
| dc.date.available | 2026-07-07T06:34:57Z | |
| dc.description | We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to model a subtyping hierarchy. Hindley-Milner type systems, such as the one found in Standard ML, can be used to enforce the subtyping relation, at least for first-order values. We show that this technique can be used to encode any finite subtyping hierarchy (including hierarchies arising from multiple interface inheritance). We formally demonstrate the suitability of the phantom-types technique for capturing first-order subtyping by exhibiting a type-preserving translation from a simple calculus with bounded polymorphism to a calculus embodying the type system of SML. | |
| dc.description | 41 pages. Preliminary version appears in the Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, pp. 448--460, 2002 | |
| dc.identifier | https://arxiv.org/abs/cs/0403034 | |
| dc.identifier | http://arxiv.org/abs/cs/0403034 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/99677 | |
| dc.subject | Programming Languages | |
| dc.subject | D.1.1; D.3.3; F.3.3 | |
| dc.title | Phantom Types and Subtyping | |
| dc.type | text |