Media Summary: Structural induction can be used to prove the correctness of functions on How to define some common operators for function application, including the pipeline operator Textbook: ... Functions can take other functions as input and return them as output, making them "higher order". Textbook: ...

Implementing Sets As Lists Ocaml - Detailed Analysis & Overview

Structural induction can be used to prove the correctness of functions on How to define some common operators for function application, including the pipeline operator Textbook: ... Functions can take other functions as input and return them as output, making them "higher order". Textbook: ... More about records vs. variants, and how variants can combine "one of" vs "each of" data. Textbook: ... Comparing the difference between `open` and `include` in modules Textbook: Defining a persistent stack data structure as an

Photo Gallery

Implementing Sets as Lists | OCaml Programming | Chapter 6 Video 5
Lists | OCaml Programming | Chapter 3 Video 1
Implementing a Counter | OCaml Programming | Chapter 7 Video 5
Another Implementation of Sets | OCaml Programming | Chapter 6 Video 6
Fold | OCaml Programming | Chapter 4 Video 5
Implementing Map | OCaml Programming | Chapter 4 Video 3
Induction on Lists | OCaml Programming | Chapter 6 Video 28
Pattern Matching with Lists | OCaml Programming | Chapter 3 Video 8
Association Lists: Bindings | OCaml Programming | Chapter 8 Video 4
Higher-Order Functions | OCaml Programming | Chapter 4 Video 1
Algebraic Data Types | OCaml Programming | Chapter 3 Video 17
Include vs Open | OCaml Programming | Chapter 5 Video 16
View Detailed Profile
Implementing Sets as Lists | OCaml Programming | Chapter 6 Video 5

Implementing Sets as Lists | OCaml Programming | Chapter 6 Video 5

Developing an

Lists | OCaml Programming | Chapter 3 Video 1

Lists | OCaml Programming | Chapter 3 Video 1

The basics of

Implementing a Counter | OCaml Programming | Chapter 7 Video 5

Implementing a Counter | OCaml Programming | Chapter 7 Video 5

How to

Another Implementation of Sets | OCaml Programming | Chapter 6 Video 6

Another Implementation of Sets | OCaml Programming | Chapter 6 Video 6

Developing a second

Fold | OCaml Programming | Chapter 4 Video 5

Fold | OCaml Programming | Chapter 4 Video 5

How to

Implementing Map | OCaml Programming | Chapter 4 Video 3

Implementing Map | OCaml Programming | Chapter 4 Video 3

How to

Induction on Lists | OCaml Programming | Chapter 6 Video 28

Induction on Lists | OCaml Programming | Chapter 6 Video 28

Structural induction can be used to prove the correctness of functions on

Pattern Matching with Lists | OCaml Programming | Chapter 3 Video 8

Pattern Matching with Lists | OCaml Programming | Chapter 3 Video 8

How to define some common operators for function application, including the pipeline operator Textbook: ...

Association Lists: Bindings | OCaml Programming | Chapter 8 Video 4

Association Lists: Bindings | OCaml Programming | Chapter 8 Video 4

How to

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: ...

Algebraic Data Types | OCaml Programming | Chapter 3 Video 17

Algebraic Data Types | OCaml Programming | Chapter 3 Video 17

More about records vs. variants, and how variants can combine "one of" vs "each of" data. Textbook: ...

Include vs Open | OCaml Programming | Chapter 5 Video 16

Include vs Open | OCaml Programming | Chapter 5 Video 16

Comparing the difference between `open` and `include` in modules Textbook: https://cs3110.github.io/textbook.

Functional Stacks | OCaml Programming | Chapter 5 Video 3

Functional Stacks | OCaml Programming | Chapter 5 Video 3

Defining a persistent stack data structure as an