Princeton University
COS 510: Programming Languages

Homework 5

Fill in the proofs in Perm.v, SearchTree.v (only those exercises noted below), and Sort.v at each place marked "Exercise". You don't have to do exercises marked "optional" except:

In SearchTree.v do only the following: