Safe Mutation in PracticeExplores safe mutation in functional programming through lazy evaluation, object invariants, and efficient caching functions.
Recursively Defined FunctionsIntroduces recursively defined functions and demonstrates how to compute values and prove properties using mathematical induction.
Total Functions: How and WhyExplores hash table efficiency, total functions in code modeling, and well-founded relations for recursive function termination.
Polymorphism and ProofsCovers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.
