I'd imagine generational GCs are perform better on OO languages, especially ones where almost everything is boxed. I have recently prototyped my own non-OO, mu

I'd imagine generational GCs are perform better on OO languages, especially ones where almost everything is boxed. I have recently prototyped my own non-OO, multifn-style polymorphic language using tagged pointers (60 bit payload, 4 bit tag) -- you can fit a float32, int/uint, etc. into 60bits -- as well as a case-insensitive 12 char alphanumeric string. Where various unboxed container types are available (eg., matrix of doubles, etc.) --- you can do a lot with just allocating to a local arena for a given scope, then resetting the arena. In this case, I lean to wards a very simple GC for all the heap stuff, since its probably going to be mostly large long-lived objects.