Efficient data representation in polymorphic languages - Archive ouverte HAL Access content directly
Conference Papers Year :

Efficient data representation in polymorphic languages

(1, 2)
1
2
Xavier Leroy

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.
Fichier principal
Vignette du fichier
data-representation-plilp.pdf (194.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01499983 , version 1 (01-04-2017)

Identifiers

Cite

Xavier Leroy. Efficient data representation in polymorphic languages. PLILP 1990: Programming Language Implementation and Logic Programming, Aug 1990, Linköping, Sweden. ⟨10.1007/BFb0024189⟩. ⟨hal-01499983⟩
232 View
74 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More