Functional Data Structures Ocaml Programming Chapter 5 Video 4

Functional data structure

How to define modules with

Defining a persistent stack

How to implement the `fold_left` and `fold_right` functionals on lists. Textbook: https://cs3110.github.io/textbook.

How to implement queues

The concerns and benefits of modular

The basics of

Functors, which is a funny name

Design of a performant immutable

Comparing the difference between `open` and `include` in modules Textbook: https://cs3110.github.io/textbook.

A dive into the standard library's Map module as an example of a functor Textbook: https://cs3110.github.io/textbook.

The syntax and semantics of ref cells Textbook: https://cs3110.github.io/textbook.

Defining module types with signatures Textbook: https://cs3110.github.io/textbook.

Distributing a module and its type into two specially-named files results in a compilation unit, which is how the standard library ...

Functions can take other functions as input and return them as output, making them "higher order". Textbook: ...

Reasons why we use

A talk about why we think

Recursion in

let` expressions Textbook: https://cs3110.github.io/textbook.