function Mismatches(s: string, t: string, n: nat): nat requires n <= |s| && n <= |t| { if n == 0 then 0 else Mismatches(s, t, n - 1) + (if s[n - 1] != t[n - 1] then 1 else 0) } lemma MismatchesAtMost(s: string, t: string, n: nat) requires n <= |s| && n <= |t| ensures Mismatches(s, t, n) <= n { if n > 0 { MismatchesAtMost(s, t, n - 1); } } method HammingDistance(s: string, t: string) returns (count: int) requires |s| == |t| ensures count == Mismatches(s, t, |s|) ensures 0 <= count <= |s| { count := 0; var i := 0; while i < |s| invariant 0 <= i <= |s| invariant count == Mismatches(s, t, i) { if s[i] != t[i] { count := count + 1; } i := i + 1; } MismatchesAtMost(s, t, |s|); }