scholar.google.com › citations
In particular, all rep- resentations must have the same size, usually one machine word, and any data which does not fit in one word has to be heap-allocated and represented by a pointer (assuming point- ers do fit in one word). In addition, the calling conventions must be exactly the same for all functions.
Jun 18, 2005 · Languages with polymorphic types (e.g. ML) have traditionally been implemented using Lisp-like data representations—everything has to fit in ...
PDF | Languages with polymorphic types (e.g. ML) have traditionally been implemented using Lisp-like data representations—everything has to fit in one.
Languages with polymorphic types (e.g. ML) have traditionally been imple- mented using Lisp-like data representations--everything has to fit in one word,.
Parsing minimalist languages · An efficient context-free parsing algorithm for natural languages and its applications · Polymorphic and metamorphic malware ...
Efficient data representation in polymorphic languages - Hal-Inria
inria.hal.science › inria-00075295
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 ...
Languages with polymorphic types (e.g. ML) have traditionally been implemented using Lisp-like data representations—everything has to fit in one word, ...
May 19, 2023 · I was wondering if anyone had thoughts on the most efficient representation of them(time and space) for functions in which their fields aren't known statically.
Languages with polymorphic types (e.g. ML) have traditionnaly been implemented using Lisp-like data representations - everything has to fit in one word, ...
For more complex types, the adtpp representation is more efficient than common C representations, while preserving type safety and convenience. As an example, ...