Higher Order Functions Ocaml Programming Chapter 4 Video 1

Functions

BYOPL course playlist: https://www.youtube.com/playlist?list=PLIgSR01UTt8OHY8WhAqOmr8EzArJYd5Z0 We define the concept ...

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

The `map` functional transforms elements of a list. Textbook: https://cs3110.github.io/textbook.

How to implement the `map` functional. Textbook: https://cs3110.github.io/textbook.

How to combine elements of a list, as a warmup for the `fold` functional. Textbook: https://cs3110.github.io/textbook.

My web page: www.imperial.ac.uk/people/n.sadawi Useful links: ...

How to use the ideas of `map` and `fold` functionals with binary trees. Textbook: https://cs3110.github.io/textbook.

Higher

In this

How to implement the `filter` functional on lists. Textbook: https://cs3110.github.io/textbook.

David Kopal twitter: https://twitter.com/coding_lawyer web: https://www.codinglawyer.io/ Get all the

My web page: www.imperial.ac.uk/people/n.sadawi.

Functional data structure do not use imperative features, hence are persistent rather than ephemeral Textbook: ...

Defining a persistent stack data structure as an

Python

This