Lecture Notes, Week 13

• Mutable data in OCaml
  • References in OCaml
  • Constructing mutable values
  • Dereferencing mutable values
  • Mutating references
  • The imperative simulation of String.mapi in terms of String.map
  • Exercise 01
  • Interlude
  • Thunks by need, revisited
  • Resources
  • Version
• A musing about variables
  • Semantics: what does “variable” mean?
  • Semiotics: meanings in names
  • Postlude
  • Acknowledgment
  • Version
• Sequencing in OCaml
  • Sequencing in retrospect
  • On the associativity of sequencing
  • Exercise 02
  • Solution for Exercise 02
  • More syntactic sugar: begin and end
  • Sequencing, iteratively: for-loops
  • Exercise 03
  • Exercise 04
  • Exercise 05
  • Functional solution for Exercise 05
  • Imperative solution for Exercise 05
  • Imperative solution for Exercise 05, with a for-loop
  • Exercise 06
  • Exercise 07
  • Exercise 08
  • Exercise 09
  • Exercise 10
  • Exercise 11
  • Sequencing, iteratively: while-loops
  • A job interview
  • Exercise 12
  • Exercise 13
  • Exercise 14
  • Exercise 15
  • Partial solution for Exercise 15
  • Resources
  • Version
• Exceptions in OCaml
  • Computing the head of a list all by ourselves
  • Computing the tail of a list all by ourselves
  • Computing list heads and tails using OCaml’s predefined functions
  • Division by 0
  • Another error case
  • Raising an exception in OCaml
  • Computing the head of a list using a predefined exception
  • Computing the tail of a list using a predefined exception
  • Our own error cases using a predefined exception
  • Resources
  • Version
• Programming using exceptions
  • Resources
  • Catching exceptions in OCaml
  • A first example
  • Exercise 16
  • Exercise 17
  • Exercise 18
  • A second example
  • Interlude
  • Declaring new exceptions in OCaml
  • Application: multiplying all the integers in a binary tree
  • Exercise 19
  • Solution for Exercise 19
  • Exercise 20
  • Solution for Exercise 20
  • Application: multiplying all the integers in a binary tree (continued)
  • Exercise 21
  • Hint about Exercise 21
  • Application: testing whether a leaf satisfies a given predicate in a binary tree
  • Exercise 22
  • Exercise 23
  • Exercise 24
  • Exercise 25
  • Resources
  • Version
• Imperative lists
  • Resources
  • Warmup
  • Unparsing imperative lists
  • Circular lists
  • How to construct a circular list
  • Interlude
  • A generic unit-test function for circular lists
  • How to detect whether an imperative list is circular: the unit-test functions
  • How to detect whether an imperative list is circular: Take 0
  • How to detect whether an imperative list is circular: Take 1
  • How to detect whether an imperative list is circular: Take 2
  • How to compute the length of an imperative list
  • How to fold right over imperative lists
  • How to fold left over imperative lists
  • How to detect whether an imperative list is circular using fold-right
  • How to detect whether an imperative list is circular using fold-left
  • How to compute the length of an imperative list using fold-left
  • How to compute the length of an imperative list using fold-right
  • How to compute the length of an imperative list using an exception
  • How to concatenate two imperative lists
  • How to reverse an imperative list
  • How to map a function over an imperative list
  • Exercise 26
  • Exercise 27
  • Exercise 28
  • Resources
  • Version
• Exercises for Week 13
  • Exercise 00
  • Mandatory exercises
  • Optional exercises
  • Optional mini-project
  • Version
• Index of concepts for Week 13
  • Version