B08
Computation as common denominator
What would a physical implementation need to reproduce beyond the output of its simulation?

X.09 / SHARED INSTRUMENTS
Which assumptions must hold for a proof about a program to cover the calculation run in the laboratory?
Formal logic and proof make the steps from assumptions to conclusions explicit. Lean's documentation offers a concrete view of propositions and proof objects checked against a formal language. Verification of scientific software adds a specification problem: the checked statement must correspond to the intended calculation. A valid proof about an incomplete model and a passing test on a few examples establish different things.
Consider the claim that a function preserves a nonnegative quantity for every allowed input. A test suite can inspect selected inputs, while a proof must use the function definition and assumptions to cover the stated domain. Then ask whether the implemented numeric representation introduces rounding or overflow absent from the formal statement.
Choose one small scientific-software invariant and write its specification before deciding whether a proof, a numerical check, or both are needed.
Lean documentation contributors · Formal propositions and proof objects; program verification depends on a stated formal specification.
B08
What would a physical implementation need to reproduce beyond the output of its simulation?
B31
Which parts of a published calculation can a reader verify directly from its inputs and executable procedure?