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]
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]
Figure 1.
Portrait of Michael R. Clarkson
. Portrait identified on the Cornell University profile.

Tagged

Ancestors (4)

  1. List of computer scientists
  2. Computer scientist
  3. Computer science
  4. Home

Incoming links (2)

Synonyms (1)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version