Media Summary: Defining a persistent stack data structure as an The fields of records can be marked as mutable, providing an alternative to refs. In fact, refs are Comparing the difference between `open` and `include` in modules Textbook:
Implementing A Counter Ocaml Programming Chapter 7 Video 5 - Detailed Analysis & Overview
Defining a persistent stack data structure as an The fields of records can be marked as mutable, providing an alternative to refs. In fact, refs are Comparing the difference between `open` and `include` in modules Textbook: References, or ref cells, are pointers to typed locations in memory. They enable imperative References make aliasing a possibility. Changes to one reference can cause changes to others. Textbook: ... To use the toplevel effectively with modules, three new directives are needed: ``, ``, and ``. Textbook: ...
Distributing a module and its type into two specially-named files results in a compilation unit, which is how the standard library ... Examples of pattern matching with lists, records, and tuples. Textbook: Hash tables are efficient imperative maps. How efficient can a purely functional map be? We'll develop red-black trees in answer ... Application of functions to "too few" of arguments, and syntactic sugar. Textbook: Hash functions are a combination of serialization, diffusion, and compression. Clients and implementers must agree on who is ... A dive into the standard library's Map module as an example of a functor Textbook:
A comparison of the cons `::` and append `@` operators. Textbook:
