Skip to content
Hallway
0:00 / 0:00

#lambdacalculus#ycombinator#functionalprogramming

Lambda Calculus - Computerphile

Computerphile

2.6M subscribers • 70 videos on Hallway

YouTube
  • Recommended by 5 people: 2 on Lobsters and 3 in engineering communities.
  • A classic. People kept recommending it from 2017 to 2022.
  • Presented by Graham Hutton, Professor of Computer Science at the University of Nottingham

Intermediate. Assumes working knowledge.

1M views9 years ago5 recommendations

Computer scienceProgramming languagesComputation and complexityFunctional programmingLanguage design and type systems

Graham Hutton explains the fundamentals of lambda calculus as the basis of functional programming.

The basis of almost all functional programming, Professor Graham Hutton explains Lambda Calculus. facebook.com/computerphile twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: bit.ly/nottscomputer Computerphile is a sister project to Brady Haran's Numberphile. More at bradyharan.com

Why it's here

5 people recommend this

What people say. Recommended as an exceptionally clear and accessible introduction to lambda calculus.

Moments people linked to

u/srivkraniin r/haskell • Recommends

Lambda Calculus - Computerphile
120View on Reddit

u/athlaknakain r/functionalprogramming • Recommends

the Y combinator and DNA replication Hi! As a preface, I hope this is the right sub for this topic, since there isn't a specific sub for Lambda Calculus, I think here is the best place do do this! I couldn't find any significant discussion about this, just a brief mention at the end of this video The structure of the Y combinator Y = λf. (λx. f(x x)) (λx. f(x x)) is very similar to that of the DNA, in which they both contain a double copy of the original. What comes to my mind is that the Y combinator is a kind of a life-giver. It can take something and put out a living(ie - capable of replicating itself) version of it. This is a nice video animation explaining DNA replication.…
18View on Reddit

u/rockymarinein r/functionalprogramming • Recommends

How to understand this TRUE defined with lambda calculus? TRUE = λ.x λ.y x TRUE and FALSE
15View on Reddit

oatson Lobsters • Recommends

Lambda Calculus - Computerphile
6View on Lobsters

flyingfischon Lobsters • Recommends

Lambda Calculus
3View on Lobsters

u/meta_leapin r/haskell • Mentions

On “Lack of good resources is a bit demotivating[kind-of venting]”

> but I do miss a good resource where you could read from beginning to end without much ado Looked into much material and honestly think the most-"programmer-friendly" material (if you have already a few years of coding experience) to first-get-hooked (the rest then follows) is the Wikibook for some reason. Has that distinct "coding tutorial series" flair of easing into things at the right pace. Also unlike text-books, they don't try to make you attack especially-contrived (or overly mathy/puzzly) "problems" as "projects to be completed upon book completion" or some such notion --- if you have coded for a while, you'll have plenty of your own ideas (aka, "the motivating kind") in your head…
36View on Reddit

u/quiteamessin r/compsci • Mentions

On “Can someone explain to me lambda calculus?”

link to this video
12View on Reddit

u/quiteamessin r/haskell • Mentions

On “Haskell Programming from first Principles: Why do lambdas matter?”

Computerphile has a video on lambdas and functional programming.
5View on Reddit

u/grahamhuttonin r/functionalprogramming • Mentions

On “Beginner - Understanding boolean logic in lambda calculus”

link to this video
2View on Reddit

u/yilmazhuseyinin r/haskell • Mentions

On “Continue reading”

link to this video
2View on Reddit

u/lacktoastNtolerancein r/Clojure • Mentions

On “Lambda Calculus in Clojure (Part 1)”

I did this about a year ago. These links helped immensely Lambda Calculus - Computerphile lambda calculus 1 lambda calculus 2 y-combinator 1 y-combinator 2 y-combinator 3
1View on Reddit