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
This commit is contained in:
alexmandClaude committed 2026-10-05 11:58:22 +00:00
commit df12b2a008
103 files changed
+3025

No files matched your search

@@ -0,0 +1,27 @@
// NeedlemanWunschScore: the best score of a global alignment of S and T
// (Needleman and Wunsch, 1970) with a linear gap model, by dynamic
// programming. D[I, J] is the best score of aligning the first I letters of
// S with the first J letters of T; each cell takes the best of three moves:
// align S[I - 1] with T[J - 1], or put a gap in one sequence or the other.
USE align.MatchScore
USE align.LinearGapPenalty
FUNCTION NeedlemanWunschScore(S : STRING, T : STRING, Match : INTEGER, Mismatch : INTEGER, Gap : INTEGER) RETURNS INTEGER
DECLARE N : INTEGER <- LENGTH(S)
DECLARE M : INTEGER <- LENGTH(T)
DECLARE D : ARRAY[N + 1, M + 1] OF INTEGER
FOR I <- 0 TO N + 1
D[I, 0] <- LinearGapPenalty(I, Gap)
NEXT I
FOR J <- 1 TO M + 1
D[0, J] <- LinearGapPenalty(J, Gap)
NEXT J
FOR I <- 1 TO N + 1
FOR J <- 1 TO M + 1
DECLARE Diagonal : INTEGER <- D[I - 1, J - 1] + MatchScore(S[I - 1], T[J - 1], Match, Mismatch)
DECLARE Down : INTEGER <- D[I - 1, J] + Gap
DECLARE Across : INTEGER <- D[I, J - 1] + Gap
D[I, J] <- MAX(Diagonal, Down, Across)
NEXT J
NEXT I
RETURN D[N, M]
ENDFUNCTION