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,43 @@
|
||||
{
|
||||
"name": "GCContent",
|
||||
"summary": "The fraction of the letters of a sequence that are G or C.",
|
||||
"tags": [
|
||||
"sequences",
|
||||
"counting"
|
||||
],
|
||||
"sources": [
|
||||
{
|
||||
"title": "Any molecular biology text: GC content"
|
||||
}
|
||||
],
|
||||
"cases": [
|
||||
{
|
||||
"call": "GCContent(\"GATTACA\")"
|
||||
},
|
||||
{
|
||||
"call": "GCContent(\"GGCC\")"
|
||||
},
|
||||
{
|
||||
"call": "GCContent(\"ATAT\")"
|
||||
}
|
||||
],
|
||||
"references": [
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "plain",
|
||||
"file": "ref/python/plain.py",
|
||||
"note": "The same count."
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "plain",
|
||||
"file": "ref/mojo/plain.mojo",
|
||||
"note": "The same count in Mojo."
|
||||
}
|
||||
],
|
||||
"proof": {
|
||||
"lang": "dafny",
|
||||
"file": "proof/gc_content.dfy",
|
||||
"note": "The count never exceeds the length, so the fraction lies in [0, 1]."
|
||||
}
|
||||
}
|
||||
Reference in new issue
Block a user