Files
pplus-library/modules/seq/hamming-distance/routine.pseudo
T
alexmandClaude df12b2a008 Start pplus-library: 16 verified routines in six modules
Routines written once in pseudo and checked at every level, so programs
can use them by name instead of rewriting and re-verifying them:

- stats: Mean, Variance (two-pass)
- numerics: KahanSum, LinearInterp, Trapezoid
- align: LinearGapPenalty, AffineGapPenalty, MatchScore,
  NeedlemanWunschScore
- md: LennardJones, LennardJonesForce, MinimumImage, PairDistance
- seq: GCContent, HammingDistance
- special: ErfApprox (Abramowitz and Stegun 7.1.26)

Each has contracts, cases, reference implementations in Python, Mojo
and (for the numerical ones) C at more than one level, and nine have a
Dafny proof over exact numbers. status.json and STATUS.md are written by
pplus-core's library-check: every check passes or is open/unverified as
listed there. The Mojo references still need the pinned compiler's
answers (library-verify-mojo, network).

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
2026-10-05 11:58:22 +00:00

16 lines
583 B
Plaintext

// HammingDistance: how many positions of two sequences of the same length
// hold different letters. The INVARIANT is what makes the ENSURE provable:
// after I positions, at most I mismatches can have been counted.
FUNCTION HammingDistance(S : STRING, T : STRING) RETURNS INTEGER
REQUIRE LENGTH(S) == LENGTH(T)
ENSURE 0 <= RESULT AND RESULT <= LENGTH(S)
DECLARE Count : INTEGER <- 0
FOR I <- 0 TO LENGTH(S)
INVARIANT 0 <= Count AND Count <= I
IF S[I] != T[I] THEN
Count <- Count + 1
ENDIF
NEXT I
RETURN Count
ENDFUNCTION