Funnily enough, on my walk home I was trying to think of how to represent this as a comic strip. In most languages the loop is the active bit, and the data structure is passive. So it's like having a creature (perhaps a fluffy!) running over the data structure and applying the function/loop body to each part of it. But in lambda-2 a data structure is the active thing that applies a function over itself, so I imagined a fluffy who applies the function to himself and then passes it on to his friends. In this case he's holding hands with one other fluffy and the function is a hula-hoop that turns him from from a fluffy into something else when he steps through. Then I remembered that fluffies don't have hands.
Have you read "Tales of the Beanworld" by Larry Marder?
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
no subject
Funnily enough, on my walk home I was trying to think of how to represent this as a comic strip. In most languages the loop is the active bit, and the data structure is passive. So it's like having a creature (perhaps a fluffy!) running over the data structure and applying the function/loop body to each part of it. But in lambda-2 a data structure is the active thing that applies a function over itself, so I imagined a fluffy who applies the function to himself and then passes it on to his friends. In this case he's holding hands with one other fluffy and the function is a hula-hoop that turns him from from a fluffy into something else when he steps through. Then I remembered that fluffies don't have hands.
Have you read "Tales of the Beanworld" by Larry Marder?