One of Jim's finest talks. It will be remembered as a timeless expression of the love of programming he embodied. People will be watching this talk for many many years. We will miss you.
This is amazing is so many ways that I can't even begin to write them down. Thank you so much for posting and /kneel to Jim Weirich, you will be missed.
7:30 -- starts explaining Lambda Calculus 12:40 -- does this mean JS got arrow functions thanks to Ruby? 21:30 -- starts about the "functional refactoring" 36:02 -- done with implementing the factorial in lambda calculus 43:45 -- splits out the Y-combinator from it
Very interesting. The explanation at 34:34 is wrong: It fails at the multiplication ("in `*'") because the right hand side must be a number, but improver (called on anything) returns a function (of the form -> (n) {...}).
The subtitles are wrong at 48 minute - he surely doesn't mean Pascal, he means Haskell programming language. Pascal not being applicative made me laugh :D Otherwise, great talk.
One of Jim's finest talks. It will be remembered as a timeless expression of the love of programming he embodied. People will be watching this talk for many many years. We will miss you.
Hey Mark! :) You given some great talks yourself. "Picket fences"
Mind blown from beyond the grave. RIP Jim.
I miss Jim. He inspired my programming and gave me the gift of ukulele.
Can't believe how helpful this was. I don't even know Ruby. Thank you so much, I finally understand.
Mind blown posthumously by Jim. I will have to re-watch many times. RIP.
and here i'm 6 years later. thanks JIm, it took me while to understand this.
This is amazing is so many ways that I can't even begin to write them down. Thank you so much for posting and /kneel to Jim Weirich, you will be missed.
7:30 -- starts explaining Lambda Calculus
12:40 -- does this mean JS got arrow functions thanks to Ruby?
21:30 -- starts about the "functional refactoring"
36:02 -- done with implementing the factorial in lambda calculus
43:45 -- splits out the Y-combinator from it
Amazing talk. Really helped me understand lambda calculus.
Very interesting. The explanation at 34:34 is wrong: It fails at the multiplication ("in `*'") because the right hand side must be a number, but improver (called on anything) returns a function (of the form -> (n) {...}).
Absolutely amazing presentation and charisma :) Thank you
Simply brilliant!
This is an excellent talk!
I have a question: How is Jim evaluating the code in his Emacs' buffer?
My mind just died. 120 times.
Anyone knows what font did he have set up here? I really like it.
copperplate gothic, or somthing very similar, i used to use it all the time.
Didn't understand a thing but it was entertaining.
RIP, watch again
Damn this guy is good.
RIP, Jim Weirich.
i dont get it, but i get how he got it, with is about as close to getting it as im going to get
The subtitles are wrong at 48 minute - he surely doesn't mean Pascal, he means Haskell programming language. Pascal not being applicative made me laugh :D
Otherwise, great talk.
Thank you for the catch, The closed captions have been fixed to properly reference Haskell and not Pascal.
there is no alpha reduction, only alpha conversion. 9:20
"wrap function" is eta expansion. 24:30
RIP
Alan Turing was the founder of Turing police.
I think I understand Lambda Calculus now. I think.
Worth it
28:56 "Mention from Brandon - I can smell the brains being [cooked?]"
跪了
Syntax is kind of weird.