Efficient data representation in polymorphic languages

Abstract : Languages with polymorphic types (e.g. ML) have traditionnaly been implemented using Lisp-like data representations - everything has to fit in one word, if necessary by being heap-allocated and handled through a pointer. The reason is that in contrast with conventional statically-typed languages such as Pascal, it is not possible to assign one unique type to each expression at compile-time, an absolute requirement for using more efficient representations (e.g. unallocated multi-word values). In this paper, we show how to take advantage of the static polymorphic typing to mix correctly two styles of data representation in the implementation of a polymorphic language : specialized efficient representations are used when types are fully known at compile-time ; uniform Lisp-like representations are used otherwise.
Type de document :
Rapport
RR-1264, INRIA. 1990
Liste complète des métadonnées

https://hal.inria.fr/inria-00075295
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 17:53:34
Dernière modification le : vendredi 16 septembre 2016 - 15:06:20
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:53:28

Fichiers

Identifiants

  • HAL Id : inria-00075295, version 1

Collections

Citation

Xavier Leroy. Efficient data representation in polymorphic languages. RR-1264, INRIA. 1990. 〈inria-00075295〉

Partager

Métriques

Consultations de la notice

120

Téléchargements de fichiers

80