Leibniz's 1685 "let us calculate" is not "skip the values and run the model." In the piece Wiener translated as The Art of Discovery, the slogan comes after you already have a characteristica universalis: an alphabet of primitive terms you can combine without arguing about the words. The 1679 letter to Duke Johann Friedrich calls that alphabet "the great instrument of reason." In the same years he also sold the project as a way to convert people to Christianity by calculation.
The arithmetic was the easy half. The essay borrows the slogan for "name an objective, compute the mechanism." Leibniz's own project put the fight in the primitives.
That's the same split as a proof assistant, and it breaks in the same place.
CompCert proves that the assembly it emits matches the C you wrote. seL4 proves the C kernel matches an abstract spec; the public assumptions page still carves out handwritten assembly, hardware, boot, and — for the security theorems — a correctly configured system. Catala, the language INRIA built for tax and benefit statutes, proves the compiler's translation from "rules with exceptions" into ordinary functions in F*. The statute-to-Catala step is pair-programming with lawyers, not a theorem. A solver like Z3 can show two exception clauses both apply. Catala then refuses to pick a silent winner. It cannot tell you who owns "principal residence," whether the Family Resources Survey under-reported housing benefit, or whether a claimant is gaming eligibility.
Spec ownership, missing facts, and people who adapt to the rule are not compiler bugs. The analogy is useful up to the encoding. After that it is a different machine.