Skip to content
0:00 / 0:00

#lazyevaluation#infinitedatastructures#haskell

Infinite Data Structures: To Infinity & Beyond! - Computerphile

Computerphile

2.6M subscribers • 66 videos on Hallway

YouTube
  • Recommended by 2 people: 2 in engineering communities.
  • A classic. People kept recommending it from 2018 to 2025.
  • Presented by Graham Hutton, Professor of Computer Science at the University of Nottingham

Beginner. No background in the topic needed.

106K views7 years ago2 recommendations

Computer scienceProgramming languagesData structuresHaskellAlgorithms

Graham Hutton explains how lazy evaluation in Haskell allows the creation and manipulation of infinite data structures.

Infinite data structures sound impossible. Professor Graham Hutton shows how laziness can win them over. EXTRA BITS: youtu.be/yCyBdeJmHM0 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

2 people recommend this

What people say. Recommended as an engaging and clear introduction to lazy evaluation and infinite lists in Haskell.

u/Critical_Pin4801in r/haskell • Recommends

I'm feeling betrayed!!!! ;_; So I have some time off and I'm relearning Haskell, and part of the charm was coming back to cute recursive, lazy, infinite definitions like this: fibSequence :: Integer fibSequence = 0 : 1 : zipWith (+) fibSequence (tail fibSequence) which is a pretty good way to define the Fibonacci sequence. And then I was looking around and watching this video, which is really fun, which gives primeSequence :: Integer primeSequence = sieveOfEratosthenes 2.. sieveOfEratosthenes :: Integer -> Integer sieveOfEratosthenes (p:ps) = p : sieveOfEratosthenes x | x <- ps, x `mod` p /= 0 And I was like OMG GENIUS! Nice. And then late…

u/grahamhuttonin r/haskell • Recommends

To infinity and beyond Computerphile