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".

In SearchTree.v do only these exercises: lookup_insert_neq, lookup_insert_same

Add a README comment describing who you helped (or got help from), and what kind of help.

Upload your assignment at right.