Unboxed Objects and Polymorphic Typing

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.

• Type: Conference
• Year: 1992
• Where: POPL
• Authors: Xavier Leroy
• Keywords: Conventional Boxed Representations, Multi-word Data Representations, POPL 1992, Programming Languages, Transformation Introduces Coercions