Combine Ocaml Programming Chapter 4 Video 4 - Detailed Analysis
How to implement the `fold_left` and `fold_right` functionals on lists. Textbook: How to implement the `map` functional. Textbook: The `map` functional transforms elements of a list. Textbook: Functions can take other functions as input and return them as output, making them "higher order". Textbook: ... How to implement the `filter` functional on lists. Textbook: Defining a persistent stack data structure as an
How to infer the type of `if` expressions in HM type inference Textbook: Using `let` definitions to bind values to names. Textbook: Application of functions to "too few" of arguments, and syntactic sugar. Textbook: It's easy to turn the red-black tree Set implementation into a Map by storing both a key and value at each node. Comparing to hash ... Functional data structure do not use imperative features, hence are persistent rather than ephemeral Textbook: ... What looks like mutability in the toplevel is not -- it's really just a consequence of scope. Textbook: ...
Photo Gallery
