tch between proof styles, trading theorems proved in one style for those in another and combining them at will. For details of these and other meta-logical results about alternative proof styles, see =-=[23]-=-. 10 Boyer-Moore Fast String Searching We conclude our demonstration of code proofs by considering the Boyer-Moore fast string searching algorithm [2]. Recall our description of how to prove code corr