Michael R. Clarkson Created 2026-10-14 Updated 2026-11-05
Michael R. Clarkson is a computer scientist whose teaching connects practical computer programming with reasoning about correctness. His work includes OCaml Programming: Correct + Efficient + Beautiful by Michael R. Clarkson and others, which develops functional programming, data structures and methods for specifying and checking program behaviour.[ref]
8.3 Module Documentation. Module implementation, abstraction functions and representation invariants
One characteristic example separates an abstraction function from a representation invariant. A list can represent a mathematical set, but an implementation that assumes no duplicate entries must maintain that condition after every operation. The explanation shows how an abstract interface is justified by concrete representation rules.[ref]
Portrait of Michael R. Clarkson
. Portrait identified on the Cornell University profile.