Infinite Data Structures: To Infinity & Beyond! - Computerphile

Infinite data structures sound impossible. Professor Graham Hutton shows how laziness can win them over.

This video was filmed and edited by Sean Riley.

[fogglee]

For anyone interested, this can be done in C# with IEnumerable<T> and the keyword 'yield'. Essentially you can "describe" a list and a function will yield the next value on demand.

[piotrarturklos]

One of the most clear explanations of anything that I've ever heard.

[tomiplaz]

Simple and beautiful. Also, this professor is a joy to listen to. He gives very clear and concise explanations.

[smuecke]

It’s a pleasure to listen to Prof. Hutton, he speaks clearly, well-structured and without ever saying “um” or anything. Also I love your videos on Haskell, it’s an elegant language that deserves a broader audience!

[BatteryAcid]

I feel like I just watched a 15 minute commercial for Haskell..

[davidefara]

This video was extremely enjoyable and interesting. Prof. Hutton was extremely clear and concise in his explanation.
Hope to see more content from him.

Thank you for this video. It kind of made me want to try to approach functional programming once more.

[StevieRZ]

"infinite list of twin primes" - do you have a secret proof you're keeping hidden from us all?

[harriehausenman]

Very understandable english, clear presentation and formidable examples!

[twistedsim]

Professeur Graham, you are such a great presentator ! It makes this video very enjoyable to watch. Thank you.

[paprika]

Functional programming is a wondrous thing, isn't it?

[martixy]

As a classical programmer, this is blowing my mind and making me wanna pick up Haskell.

[lemonprime]

I'm really enjoying Brady's editing in this one.

[stirnermax]

I'm learning a bit of Haskell with the help of the book "Programming in Haskell",
can you imagine how surprised i was when i realized the man in the video IS the Graham Hutton author of the book?!
Btw i strongly recommend his book, a very clear and fun introduction to Haskell.
As other people in the comment section I would definitely enjoy to see more videos with the professor

[wliaputs]

For those who don't understand list comprehension, the sieve program can be written as follows using filter instead:

primes = sieve [2..]
sieve (p:ps) = p : sieve (filter (\x -> x `mod` p /= 0) ps)

[nahco]

This should definitely be cross-posted to the Numberphile channel.

[MartinLeggewie]

Thank you very much for this video about this very elegant way of programming in a functional language. And kudos to Mr Hutton for his friendly, relaxed, controlled, and - most important - understandable way of explaining this topic.

[amaarquadri]

With an object oriented programming language using the sieve of eristothanes and making it dynamically increase as more output is required would be way more complicated. This is awesome!

[mikegb]

I love the videos with Graham Hutton and Haskell.

[davide]

This makes me want to learn Haskell SO MUCH!

[snbeast]

2:32 So no proof that 1 + 2 + 3... = -1/12?