Media Summary: Functional data structure do not use imperative features, hence are persistent rather than ephemeral Textbook: ... How to implement the `fold_left` and `fold_right` functionals on lists. Textbook: Defining a persistent stack data structure as an
Module Types And Signatures Ocaml Programming Chapter 5 Video 9 - Detailed Analysis & Overview
Functional data structure do not use imperative features, hence are persistent rather than ephemeral Textbook: ... How to implement the `fold_left` and `fold_right` functionals on lists. Textbook: Defining a persistent stack data structure as an How to implement queues functionally, and how to improve efficiency by using two lists instead of one. Note that the textbook now ... Comparing the difference between `open` and `include` in Developing an implementation of a data abstraction, as an ongoing example of the documentation that implementers need ...
Functions can take other functions as input and return them as output, making them "higher order". Textbook: ... How to implement a Map ADT with association lists as the rep Modifying the parser and AST to incorporate Functors, which is a funny name for an elegant concept: functions on
