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,69 @@
|
||||
{
|
||||
"name": "Mean",
|
||||
"summary": "The arithmetic mean of a list of numbers.",
|
||||
"tags": [
|
||||
"statistics",
|
||||
"summation"
|
||||
],
|
||||
"sources": [
|
||||
{
|
||||
"title": "Any statistics text: the sample mean, the sum divided by the count"
|
||||
}
|
||||
],
|
||||
"cases": [
|
||||
{
|
||||
"call": "Mean([1.0, 2.0, 3.0, 4.0])"
|
||||
},
|
||||
{
|
||||
"call": "Mean([0.1, 0.1, 0.1])"
|
||||
},
|
||||
{
|
||||
"call": "Mean([-5.0, 5.0])"
|
||||
},
|
||||
{
|
||||
"call": "Mean([1.0e300, 1.0e300])"
|
||||
},
|
||||
{
|
||||
"call": "Mean([2.5])"
|
||||
}
|
||||
],
|
||||
"references": [
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "plain",
|
||||
"file": "ref/python/plain.py",
|
||||
"note": "The same loop: one running total, added to in order."
|
||||
},
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "fsum",
|
||||
"file": "ref/python/fsum.py",
|
||||
"note": "math.fsum rounds the sum once, exactly; the plain loop rounds at every step, so the two can differ in the last digit.",
|
||||
"rel": 1e-15
|
||||
},
|
||||
{
|
||||
"lang": "c",
|
||||
"level": "plain",
|
||||
"file": "ref/c/plain.c",
|
||||
"note": "The same loop in C. Without -ffast-math the compiler keeps the additions in order at every optimization level."
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "plain",
|
||||
"file": "ref/mojo/plain.mojo",
|
||||
"note": "The same loop in Mojo."
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "unrolled",
|
||||
"file": "ref/mojo/unrolled.mojo",
|
||||
"note": "Four running totals, as a vectorizing compiler keeps them: faster on long lists, and the additions happen in a different order, so the last digit can differ.",
|
||||
"rel": 1e-15
|
||||
}
|
||||
],
|
||||
"proof": {
|
||||
"lang": "dafny",
|
||||
"file": "proof/mean.dfy",
|
||||
"note": "Over real numbers: the loop computes Sum(X) / |X|, and the mean lies between the smallest and largest value (rounding can push the FLOAT result just outside, as Mean([0.1, 0.1, 0.1]) shows)."
|
||||
}
|
||||
}
|
||||
Reference in new issue
Block a user