COMP 302 Lecture 12: Feb 2 (W5,L3): Closures and Objects

• School: McGill University
• Department: Computer Science (Sci)
• Course: COMP 302
• Professor: Prakash Panangaden

Document Summary

Today: higher order objects and objects as closures. We want to have something that flips values. Until we introduced the notion of mutation, there was a strict rule: every time you evaluate an expression, it will always give you the same value. Input let mutable a = 0 let flip0 () = (a unit . No actual value is fed, no actual value is returned, just a dummy. The variable a is global and completely unprotected.