Lambda (λ) Calculus Primer
Vložit
- čas přidán 4. 09. 2023
- A primer on the lambda calculus with the aim of giving a basic understanding of the theoretical underpinnings of functional programming.
Contents:
1. What is the lambda calculus?
2. Defining a function as a lambda abstraction
3. The simple untyped lambda calculus
4. Evaluation rules
5. Normal form and reduction orders
-------------------------------------------------------
This video is part of the Introduction to Functional Programming with Haskell video course ( • Intro to Functional Pr... ).
Code shown in the course is available on Github here: github.com/LigerLearn/intro-t...
Thank you. The best video on lambda calculus I’ve seen so far.
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. 🙏
Thanks for this, explains it very well
Incredible tutorial.
Thank your very good course.
This video is great! Appreciate it a lot
Great video !
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
Cristal clear introduction to Lambda Calculus
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.
Nice video
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.
Very well explained, thank you
TIL the creator of lambda calculus died in a town 30 minutes from me
Haskell doesn't reduce to normal form, it reduces to weak head normal firm
Free means that a variable in the body has none in the head, not what you're trying to say here.
Your eta reduction is incorrect. The 1 would be the second argument
wannazhina!
我s
se x
bibilbilbilbilblibilbilbliblibilblibliblibli