Perhaps the formal meaning of flattening is to take all of the cells in order. I am possibly using the term incorrectly, but referring to a process where siblings interact with direct parent (placing brackets around a sibling group for instance) as they unroll up into their parent node. I don't know if unrolling a tree is a formal term, but it ends up being flat at the end of the process.
----- Original Message ----- From: Raul Miller <[email protected]> To: Programming forum <[email protected]> Cc: Sent: Thursday, September 4, 2014 12:14:22 AM Subject: Re: [Jprogramming] A symetrical hash function that outputs valid J variable names On Wed, Sep 3, 2014 at 10:28 PM, 'Pascal Jasmin' via Programming <[email protected]> wrote: > The difference between using L:1 and S:1 is that with L:1 the tree > structure is kept. When used recursively, the tree gets rolled up > from the bottom. If there is a relationship with the group of cells > at a tree level, it cannot be expressed with S: . But if you are flattening the tree then you explicitly are eliminating that relationship. > I don't understand what you mean by unification scheme. https://en.wikipedia.org/wiki/Unification_algorithm Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
