I don't think we have any firm data on how costly this is compared to
polyinstaniation and uniform representations. This bitmask approach is
being taken seriously by SML# [1].
Sandro
[1] http://www.pllab.riec.tohoku.ac.jp/smlsharp/
On 2011-04-02, at 5:15, "Jonathan S. Shapiro" <[email protected]> wrote:
On Fri, Apr 1, 2011 at 10:32 PM, Alex Burr <[email protected]>
wrote:
I've always wondered why you couldn't just automate the way you have
to do this
in C: have a generic version of the function with hidden parameters
containing
the various necessary
lengths and offsets...
You can. The catch is that the first thing you'll need is offsets
into the frame record to determine where each argument starts. It's
really quite expensive.
A better approach, I think, would be to do some form of
metacompilation for this sort of thing.
_______________________________________________
bitc-dev mailing list
[email protected]
http://www.coyotos.org/mailman/listinfo/bitc-dev
_______________________________________________
bitc-dev mailing list
[email protected]
http://www.coyotos.org/mailman/listinfo/bitc-dev
