• Digital Mark
    link
    fedilink
    English
    11 year ago

    There’s some math & CS papers you should read, Gödel’s incompleteness theorem, Turing’s halting problem. YOU CANNOT prove your way out of logic errors. You cannot make a universal type system. All you’re doing is wasting time with false confidence.

    • @colonial
      link
      21 year ago

      I never said that static typing stops all logic errors or fully proves program correctness, but go off I guess…