informal methods – keeping simple

Trees in informal methods

What’s a tree? First define a sequence or length n> 0 as a total map s: {1,.. n}→ X. Let Nil be the empty sequence.

What’s a linked list? Let V be a set of values and A be a set of “addresses”. Say a map f is a “linked

Updated rough draft available with thrilling descriptions of atomic compare and swap and some comments on “formal methods”. Bonus photo