July 2023
Intermediate to advanced
670 pages
17h 13m
English
Linked lists are a first class data structure that you will use frequently throughout this book and as you are writing programs in Haskell. In the last chapter, you were introduced to the basics of Haskell’s syntax and learned how to create some simple lists. In this chapter, you’ll learn more about how to work with lists using higher-order functions like map and foldr, how to write recursive functions over lists effectively using pattern matching, and finally, you’ll learn about how to deal with streaming data, generators, and infinitely long lists by exploiting Haskell’s laziness.
Read now
Unlock full access