International audienceThis 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
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
Statically typed languages with Hindley-Milner polymorphism have long been compiled using inefficien...
Statically typed languages with Hindley-Milner polymorphism have long been compiled using inefficien...
International audienceThis paper presents a program transformation that allows languages with polymo...
International audienceLanguages with polymorphic types (e.g. ML) have traditionally been implemented...
International audienceLanguages with polymorphic types (e.g. ML) have traditionally been implemented...
International audienceWe present a new approach to the polymorphic typing of data accepting in-place...
Traditional techniques for implementing polymorphism use a universal representation for objects of u...
Flexibility of programming and efficiency of program execution are two important features of a progr...
There is a middle ground between parametric and ad-hoc polymorphism in which a computation can depen...
Traditional techniques for implementing polymorphism use auniversal representation for objects of un...
There is a middle ground between parametric and ad-hoc polymorphism in which a computation can depen...
International audienceWe compare the efficiency of type-based unboxing strategies with that of simpl...
The ML programming language restricts type polymorphism to occur only in the "let-in" construct and ...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
Statically typed languages with Hindley-Milner polymorphism have long been compiled using inefficien...
Statically typed languages with Hindley-Milner polymorphism have long been compiled using inefficien...
International audienceThis paper presents a program transformation that allows languages with polymo...
International audienceLanguages with polymorphic types (e.g. ML) have traditionally been implemented...
International audienceLanguages with polymorphic types (e.g. ML) have traditionally been implemented...
International audienceWe present a new approach to the polymorphic typing of data accepting in-place...
Traditional techniques for implementing polymorphism use a universal representation for objects of u...
Flexibility of programming and efficiency of program execution are two important features of a progr...
There is a middle ground between parametric and ad-hoc polymorphism in which a computation can depen...
Traditional techniques for implementing polymorphism use auniversal representation for objects of un...
There is a middle ground between parametric and ad-hoc polymorphism in which a computation can depen...
International audienceWe compare the efficiency of type-based unboxing strategies with that of simpl...
The ML programming language restricts type polymorphism to occur only in the "let-in" construct and ...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
Types have been used to describe the size and shape of data structures at compile time. In polymorph...
Statically typed languages with Hindley-Milner polymorphism have long been compiled using inefficien...
Statically typed languages with Hindley-Milner polymorphism have long been compiled using inefficien...