Media Summary: How to implement the `fold_left` and `fold_right` functionals on lists. Textbook: Functions can take other functions as input and return them as output, making them "higher order". Textbook: ... How to combine elements of a list, as a warmup for the `

Trees With Map And Fold Ocaml Programming Chapter 4 Video 7 - Detailed Analysis & Overview

How to implement the `fold_left` and `fold_right` functionals on lists. Textbook: Functions can take other functions as input and return them as output, making them "higher order". Textbook: ... How to combine elements of a list, as a warmup for the ` References, or ref cells, are pointers to typed locations in memory. They enable imperative How to implement a function that counts up with every invocation, using references Textbook: Examples of pattern matching with lists, records, and tuples. Textbook:

A notion of "behavioral equality" is at the heart of reasoning about the correctness of functional programs Textbook: ...

Photo Gallery

Trees with Map and Fold | OCaml Programming | Chapter 4 Video 7
Fold | OCaml Programming | Chapter 4 Video 5
Map | OCaml Programming | Chapter 4 Video 2
Implementing Map | OCaml Programming | Chapter 4 Video 3
Higher-Order Functions | OCaml Programming | Chapter 4 Video 1
Combine | OCaml Programming | Chapter 4 Video 4
Refs | OCaml Programming | Chapter 7 Video 1
Implementing a Counter | OCaml Programming | Chapter 7 Video 5
Hash Tables vs Other Data Structures for Maps | OCaml Programming | Chapter 8 Video 19
Pattern Matching | OCaml Programming | Chapter 3 Video 7
Equality of Expressions | OCaml Programming | Chapter 6 Video 22
Binary Trees | OCaml Programming | Chapter 3 Video 23
Sponsored
View Detailed Profile
Trees with Map and Fold | OCaml Programming | Chapter 4 Video 7

Trees with Map and Fold | OCaml Programming | Chapter 4 Video 7

How to use the ideas of `

Fold | OCaml Programming | Chapter 4 Video 5

Fold | OCaml Programming | Chapter 4 Video 5

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

Map | OCaml Programming | Chapter 4 Video 2

Map | OCaml Programming | Chapter 4 Video 2

The `

Implementing Map | OCaml Programming | Chapter 4 Video 3

Implementing Map | OCaml Programming | Chapter 4 Video 3

How to implement the `

Higher-Order Functions | OCaml Programming | Chapter 4 Video 1

Higher-Order Functions | OCaml Programming | Chapter 4 Video 1

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

Sponsored
Combine | OCaml Programming | Chapter 4 Video 4

Combine | OCaml Programming | Chapter 4 Video 4

How to combine elements of a list, as a warmup for the `

Refs | OCaml Programming | Chapter 7 Video 1

Refs | OCaml Programming | Chapter 7 Video 1

References, or ref cells, are pointers to typed locations in memory. They enable imperative

Implementing a Counter | OCaml Programming | Chapter 7 Video 5

Implementing a Counter | OCaml Programming | Chapter 7 Video 5

How to implement a function that counts up with every invocation, using references Textbook: https://cs3110.github.io/textbook.

Hash Tables vs Other Data Structures for Maps | OCaml Programming | Chapter 8 Video 19

Hash Tables vs Other Data Structures for Maps | OCaml Programming | Chapter 8 Video 19

The pros and cons of three

Pattern Matching | OCaml Programming | Chapter 3 Video 7

Pattern Matching | OCaml Programming | Chapter 3 Video 7

Examples of pattern matching with lists, records, and tuples. Textbook: https://cs3110.github.io/textbook.

Equality of Expressions | OCaml Programming | Chapter 6 Video 22

Equality of Expressions | OCaml Programming | Chapter 6 Video 22

A notion of "behavioral equality" is at the heart of reasoning about the correctness of functional programs Textbook: ...

Binary Trees | OCaml Programming | Chapter 3 Video 23

Binary Trees | OCaml Programming | Chapter 3 Video 23

How to define a type for binary

Functional Maps and Sets | OCaml Programming | Chapter 8 Video 27

Functional Maps and Sets | OCaml Programming | Chapter 8 Video 27

Hash tables are efficient imperative