A Falsification View of Success Typing — mentioned by yorwba

Wed, 21 Mar 2018 05:11:15 GMT

When you're having trouble justifying at compile time that a property holds, it's not always because you don't know why it holds, but frequently a problem with the type system you have to write the justification in. Some type systems are so limited that you can't even express the conditions under which the property holds, let alone prove them. Others are powerful enough to prove anything, but that makes type inference intractable, because the inferencer might have to prove arbitrary theorems. The advantage of dynamically typed languages is that you are not glued to one specific proof language…

Paper and discussion history. A mention is not an endorsement.

A Falsification View of Success Typing · HackerPapers discussions

A Falsification View of Success Typing — mentioned by yorwba