Media Summary: How to combine elements of a list, as a warmup for the ` Defining a persistent stack data structure as an How to implement the `map` functional. Textbook:
Fold Ocaml Programming Chapter 4 Video 5 - Detailed Analysis & Overview
How to combine elements of a list, as a warmup for the ` Defining a persistent stack data structure as an How to implement the `map` functional. Textbook: Functions can take other functions as input and return them as output, making them "higher order". Textbook: ... Functional data structure do not use imperative features, hence are persistent rather than ephemeral Textbook: ... How to implement the `filter` functional on lists. Textbook:
The `map` functional transforms elements of a list. Textbook: More about records vs. variants, and how variants can combine "one of" vs "each of" data. Textbook: ... How to implement a function that counts up with every invocation, using references Textbook: More about using pattern matching with variants. Textbook:
