Want to keep learning?

This content is taken from the The University of Glasgow's online course, Functional Programming in Haskell: Supercharge Your Coding. Join the course to learn more.

Skip to 0 minutes and 8 secondsJEREMY: Hi, and welcome back to week three of the Functional Programming in Haskell course. This week, we'll be exploring the list data structure in even more detail. Then, we'll move on to defining custom data structures. This is an important part of any high-level programming language. Finally, we'll dig into the history of Haskell. Where did it come from? Why does it look like it does? We'll be asking one of the main architects of the Haskell language to answer some of these questions for us. Hope you enjoy the week. See you later.

Welcome to Week 3

This week we will go a little deeper into functional programming. The concept of recursion is a key design pattern. You will see that recursion is a natural way to process list data. We are going to look at list combinators, like map and fold. While we are only operating on small lists, these are exactly the operations that analysts use to crunch big data on massive clusters.

After a brief excursion into tree data types, we will uncover some of the history of Haskell towards the end of the week. Jeremy interviews Simon Peyton Jones, who works at Microsoft Research Cambridge. Simon is an honorary Professor at Glasgow, and one of the lead designers of Haskell.

Share this video:

This video is from the free online course:

Functional Programming in Haskell: Supercharge Your Coding

The University of Glasgow

Get a taste of this course

Find out what this course is like by previewing some of the course steps before you join: