Quick Overview: Defining a persistent stack data structure as an Functional data structure do not use imperative features, hence are persistent rather than ephemeral Textbook: ... Comparing the difference between `open` and `include` in modules Textbook:
Functors Ocaml Programming Chapter 5 - Detailed Overview & Context
Defining a persistent stack data structure as an Functional data structure do not use imperative features, hence are persistent rather than ephemeral Textbook: ... Comparing the difference between `open` and `include` in modules Textbook: Defining module types with signatures Textbook: The `include` statement enables re-use of implementation and interface code as a kind of "smart copy and paste" Textbook: ... How to implement queues functionally, and how to improve efficiency by using two lists instead of one. Note that the textbook now ...
Definitions of module types for the stack and queue modules developed in previous videos Textbook: ... How to define modules with structures Textbook: Using abstract types to achieve encapsulation in data structures Textbook: To use the toplevel effectively with modules, three new directives are needed: ``, ``, and ``. Textbook: ... How to implement the `fold_left` and `fold_right` functionals on lists. Textbook:
