Efficient data representation in polymorphic languages

Abstract : Languages with polymorphic types (e.g. ML) have traditionally 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 :
Communication dans un congrès
Pierre Deransart; Jan Maluszynski. PLILP 1990: Programming Language Implementation and Logic Programming, Aug 1990, Linköping, Sweden. Springer, 456, LNCS. 〈10.1007/BFb0024189〉
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01499983
Contributeur : Xavier Leroy <>
Soumis le : samedi 1 avril 2017 - 20:24:31
Dernière modification le : mardi 4 avril 2017 - 01:11:53
Document(s) archivé(s) le : dimanche 2 juillet 2017 - 12:56:11

Fichier

data-representation-plilp.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Xavier Leroy. Efficient data representation in polymorphic languages. Pierre Deransart; Jan Maluszynski. PLILP 1990: Programming Language Implementation and Logic Programming, Aug 1990, Linköping, Sweden. Springer, 456, LNCS. 〈10.1007/BFb0024189〉. 〈hal-01499983〉

Partager

Métriques

Consultations de la notice

225

Téléchargements de fichiers

22