Quick Overview: How to implement a function that counts up with every invocation, using A deep dive into implementing lists with mutable fields Textbook: The fields of records can be marked as mutable, providing an alternative to
Refs Ocaml Programming Chapter 7 - Detailed Overview & Context
How to implement a function that counts up with every invocation, using A deep dive into implementing lists with mutable fields Textbook: The fields of records can be marked as mutable, providing an alternative to The second part of a deep dive into implementing lists with mutable fields. Textbook: A notion of "behavioral equality" is at the heart of reasoning about the correctness of functional programs Textbook: ... How to raise exceptions, which are really variants. Textbook:
Examples of pattern matching with lists, records, and tuples. Textbook: HM type inference of `let` expressions led to type schemes, which enabled polymorphism. Add mutability, though, could lead to a ... How to implement a Map ADT with association lists as the rep type Textbook: The semicolon operator is used to sequence imperative commands Textbook: Compilers translate code from one language to another. Interpreters execute code. Virtual machines and just-in-time compilation ... Structural induction can be used to prove the correctness of functions on lists Textbook:
How to implement queues functionally, and how to improve efficiency by using two lists instead of one. Note that the textbook now ...
