Unboxed objects and polymorphic typing
Résumé
This paper presents a program transformation that allows languages with polymorphic typing (e.g. ML) to be implemented with unboxed, multi-word data representations , more efficient than the conventional boxed representations. The transformation introduces coercions between various representations, based on a typing derivation. A prototype ML compiler utilizing this transformation demonstrates important speedups.
Domaines
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |