Functional Data Structures Ocaml Programming

Functional data structure

References: - Source Code: https://gitlab.com/tsoding/99-

Defining a

Hash tables are efficient imperative maps. How efficient can a purely

Functors, which is a funny name for an elegant concept: functions on modules Textbook: https://cs3110.github.io/textbook.

How to implement queues

let` expressions Textbook: https://cs3110.github.io/textbook.

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

...

So yeah as they mentioned I'm come on and my talk is gonna be about

Hash functions are a combination of serialization, diffusion, and compression. Clients and implementers must agree on who is ...

How to implement a

How to implement the `map`

The basics of

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

This is a brief introduction to

How to make functions be recursive. Textbook: https://cs3110.github.io/textbook.

A dive into the standard library's Map module as an example of a functor Textbook: https://cs3110.github.io/textbook.

What looks like mutability in the toplevel is not -- it's really just a consequence of scope. Textbook: ...