Comment on Verified dynamic programming with Σ-types in LeanparentComments−duve021yYou could write this same proof in absolutely any language that supports recursionWell, you at least need dependent types just to state the theorem, which eliminates nearly all other languages.
Comments
Well, you at least need dependent types just to state the theorem, which eliminates nearly all other languages.