PLT: Lambda Calculus - Basics 1
Loading...
4,441
Loading...
Uploader Comments (rlindeque)
see all
All Comments (21)
-
You successfully cleared up something I couldn't understand the entire semester.
Thank you very much!
-
yea, let's not be stupid with that monkey ...
-
Have you really said "why is this the shizzle?" :D ... made my day :)
-
-
monkey? There is a monkey in lambda calculus? I'm confused.
-
This is great. I flipped book after book. All equally cryptic. Finally something I can understand .. yayy
Loading...
I think the second squaring example was rather misleading and likely to confuse people.
loogel 9 months ago
@loogel I agree it's a little bit confusing. Lecture 4 will be formal reduction/substitution rules, once I get there I hope that it'll be a little bit more clear.
rlindeque 9 months ago
Fyi, you have quite a bit of static in the background on this one.
loogel 9 months ago
@loogel Yes this is the first one I did - terrible quality :) I want to redo at least these first three lambda-calculus tutorials eventually, but decided to focus on new material for now rather than being overly perfectionistic.
rlindeque 9 months ago
Well done Rehno, it was quite a good introduction. Please could you explain how it translates to or can be used in writing a program perhaps using a short example.
theodorekoopman 10 months ago
@theodorekoopman Thanks Theo! Well it could take some time to get there. I took down my follow up lectures because they had errors, but I'll redo them soon. These demonstrate natural numbers and all the arithmetic operations using pure lambda calculus and then goes on to boolean logic. Lisp is quite closely related to lambda calculus, so that's probably the closest you'll get to a real world application, though many PL's have lambda's implemented as anonymous functions as well as closures.
rlindeque 10 months ago