On Jan 22, 2016, at 1:03 AM, Peter Levart <[email protected]> wrote:
> 
> a symmetric configuration where each nest-mate lists all nest-mates in a 
> single Nest attribute

That uses storage quadratic in the number of nestmates.  A big price for beauty!
Better to go with transitive closure on a graph (linear storage).
That takes us straight to a simple star graph, which is why we have a NestTop.

Fun fact:  If the nestmate relation is an equivalence relation, any class can
be the top.  This means that a compiler could put the bulky nestmate list
into a small synthetic class, at least in principle.  (Might look surprising
under reflection.)

— John

Reply via email to