2 papers
cs.PL2015
A Falsification View of Success Typing
Robert Jakob, Peter Thiemann
Dynamic languages are praised for their flexibility and expressiveness, but static analysis often yields many false positives and verification is cumbersome for lack of structure.…
cs.PL2013
Towards Tree Automata-based Success Types
Robert Jakob, Peter Thiemann
Error detection facilities for dynamic languages are often based on unit testing. Thus, the advantage of rapid prototyping and flexibility must be weighed against cumbersome and ti…