Thank you for clearly defining each little bit of notation. I find maths incredibly hard because the nomenclature is always obscure. I don't know how to look up "little squiggly thing that looks like a 'd' with a fancy hat". Knowing how to read the maths like a sentence is incredibly useful. Thank you! I've wanted to learn Haskell for a while now but I suck hard at math. I brute-forced my way through engineering school. It was hell. Thank you for this excellent content
I love how you explain about Beta-reduction very clear. Thank you so much. By the way I love Haskell. So I subscribed this channel and I hope I can learn more about Haskell through this channel. 🙏
Thanks for the video... Although the use of parenthesis helps to clarify things, it confuses me a little since there are no rule BNF rule for use of parenthesis in 6:24
The content was well done, but I have some feedback on how the video was edited. I may be more photosensitive than the average person, but around 3:35, and for most of the rest of the video, when you were highlighting stuff the end effect of how you did it was to flash almost the entire screen several times per minute from light to dark and back. Some of the latter transitions started doing a fade, which helped, but the rapid flashing of the whole screen like that made the video hard to watch.
Really great introduction to lambda calculus ! However, it would have been nice to have practical examples of use for lambda calculus, I still have some questions unanswered, like when is it useful, or why ?
As mentioned in the video, lambda calculus is the theory underpinning all of functional programming, and is used as an intermediate representation for functional languages. It's equivalent to a Turing Machine, as both a mechanism for computing and as a definition of computability.
Thank you. The best video on lambda calculus I’ve seen so far.
Thank you for clearly defining each little bit of notation. I find maths incredibly hard because the nomenclature is always obscure. I don't know how to look up "little squiggly thing that looks like a 'd' with a fancy hat". Knowing how to read the maths like a sentence is incredibly useful. Thank you! I've wanted to learn Haskell for a while now but I suck hard at math. I brute-forced my way through engineering school. It was hell. Thank you for this excellent content
Literally pretty much the only useful tutorial on this topic that I could find
I love how you explain about Beta-reduction very clear. Thank you so much. By the way I love Haskell. So I subscribed this channel and I hope I can learn more about Haskell through this channel. 🙏
Excellent explanation for a beginner. Thanks.
Thanks for the video... Although the use of parenthesis helps to clarify things, it confuses me a little since there are no rule BNF rule for use of parenthesis in 6:24
Thanks for this, explains it very well
The content was well done, but I have some feedback on how the video was edited. I may be more photosensitive than the average person, but around 3:35, and for most of the rest of the video, when you were highlighting stuff the end effect of how you did it was to flash almost the entire screen several times per minute from light to dark and back. Some of the latter transitions started doing a fade, which helped, but the rapid flashing of the whole screen like that made the video hard to watch.
Incredible tutorial.
Thank your very good course.
TIL the creator of lambda calculus died in a town 30 minutes from me
This video is great! Appreciate it a lot
Really great introduction to lambda calculus !
However, it would have been nice to have practical examples of use for lambda calculus, I still have some questions unanswered, like when is it useful, or why ?
As mentioned in the video, lambda calculus is the theory underpinning all of functional programming, and is used as an intermediate representation for functional languages. It's equivalent to a Turing Machine, as both a mechanism for computing and as a definition of computability.
Cristal clear introduction to Lambda Calculus
Great video !
Nice video
Very well explained, thank you
Haskell doesn't reduce to normal form, it reduces to weak head normal firm
Your eta reduction is incorrect. The 1 would be the second argument
Free means that a variable in the body has none in the head, not what you're trying to say here.
It is free in the lambda body, not the whole expression
我s
bibilbilbilbilblibilbilbliblibilblibliblibli
wannazhina！
se x