4 ms·
Nope. C-H concerns the simply typed lambda calculus which is not Turing-complete. Thus C-H only applies to non-recursive functional programs (or equivalent). A
by jahewson 15y ago
Nope. C-H concerns the simply typed lambda calculus which is not Turing-complete. Thus C-H only applies to non-recursive functional programs (or equivalent).
A proof is a program, but a program is not always a proof (as proofs must terminate).
- gatlin 15y agoI concede. Thanks for the interesting tangent of reading that brought on, too!