I always thought this was up there with "monads are like burritos" in terms of how it makes things more complicated instead of simplifying them. Maybe that's just my old ass, and kids would appreciate it more. When I was a kid one of my teachers referred to the > and < symbols as "alligator mouths" and said "Just remember the alligator mouth eats the bigger number." Helped me keep those symbols straight for years.
Yeah, I "get" it, but I can only think that as a kid I would have been too upset about all the senseless alligator deaths to internalize the patterns. I guess if they're not old enough to know algebra, (λx.x λy.y)(λz.z) might be more scary than a reptilian predator.
The thing that made me grok lambda calculus was someone[0] in a tutorial online treated as a simple substitution game. They said: Imagine "λx.chocolate covered x" is a lambda expression, and if you apply that to "peanuts" you get "chocolate covered peanuts" and if you apply it to "ants" you get "chocolate covered ants". I knew at that time that LAMBDA was an operator for creating "anonymous functions" in Lisp you could pass to MAP or APPLY, but the "chocolate covered" thing was what made the penny drop that in pure LC, a lambda is just a template with a variable, and application (beta reduction) is substituting values for variables in the templates.
This post many years ago made me realize that there's nothing uniquely interesting about lambda calculus. That it's just weird, convoluted virtual machine that can be (barely) used for programming.
I always thought this was up there with "monads are like burritos" in terms of how it makes things more complicated instead of simplifying them. Maybe that's just my old ass, and kids would appreciate it more. When I was a kid one of my teachers referred to the > and < symbols as "alligator mouths" and said "Just remember the alligator mouth eats the bigger number." Helped me keep those symbols straight for years.
Thats exactly how my teacher in second grade when I was 8 years old (in Germany) taught us about greater than ans less than.
Yeah, I "get" it, but I can only think that as a kid I would have been too upset about all the senseless alligator deaths to internalize the patterns. I guess if they're not old enough to know algebra, (λx.x λy.y)(λz.z) might be more scary than a reptilian predator.
The thing that made me grok lambda calculus was someone[0] in a tutorial online treated as a simple substitution game. They said: Imagine "λx.chocolate covered x" is a lambda expression, and if you apply that to "peanuts" you get "chocolate covered peanuts" and if you apply it to "ants" you get "chocolate covered ants". I knew at that time that LAMBDA was an operator for creating "anonymous functions" in Lisp you could pass to MAP or APPLY, but the "chocolate covered" thing was what made the penny drop that in pure LC, a lambda is just a template with a variable, and application (beta reduction) is substituting values for variables in the templates.
[0] It was probably Jim Larson: https://www.cs.unc.edu/~stotts/COMP204/Lambda/scheme.html
thanks for the link, I enjoyed reading that
I suppose birds are a kind of reptile if they like reading Smullyan.
Some past discussions. I thought it had been discussed more but maybe it turned up in other discussions rather than as a submission of its own.
https://news.ycombinator.com/item?id=8906167 - Jan 18, 2015 (24 comments)
https://news.ycombinator.com/item?id=4586692 - Sept 28, 2012 (24 comments)
https://news.ycombinator.com/item?id=600736 - May 9, 2009 (9 comments)
This post many years ago made me realize that there's nothing uniquely interesting about lambda calculus. That it's just weird, convoluted virtual machine that can be (barely) used for programming.
[dead]