After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, th...
Although data pow analysis was first developed for use in compilers, its usefulness is now recognized in many software tools. Because of its compiler origins, the computation of d...
—In this contribution we provide a thorough stability analysis of gradient type algorithms with non-symmetric matrix step-sizes. We hereby extend existing analyses for symmetric ...
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
This paper presents a new term extraction approach using relevance between term candidates calculated by a link analysis based method. Different types of relevance are used separa...