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:
103 files changed
+3025
No files matched your search
@@ -0,0 +1,6 @@
|
||||
def hamming_distance(s: String, t: String) -> Int:
|
||||
var count = 0
|
||||
for i in range(s.count_codepoints()):
|
||||
if String(s[codepoint=i]) != String(t[codepoint=i]):
|
||||
count = count + 1
|
||||
return count
|
||||
@@ -0,0 +1,2 @@
|
||||
def hamming_distance(s, t):
|
||||
return sum(1 for a, b in zip(s, t) if a != b)
|
||||
Reference in new issue
Block a user