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
11 lines
472 B
Plaintext
11 lines
472 B
Plaintext
// MatchScore: the score of aligning letter A with letter B: Match when they
|
|
// are the same letter, Mismatch otherwise. The simplest substitution score;
|
|
// a substitution matrix such as BLOSUM62 replaces it for proteins.
|
|
FUNCTION MatchScore(A : CHAR, B : CHAR, Match : INTEGER, Mismatch : INTEGER) RETURNS INTEGER
|
|
ENSURE (A == B AND RESULT == Match) OR (A != B AND RESULT == Mismatch)
|
|
IF A == B THEN
|
|
RETURN Match
|
|
ENDIF
|
|
RETURN Mismatch
|
|
ENDFUNCTION
|