A Polyvariant Type Analysis for Erlang

摘要: This paper presents a type analysis for the programming language Erlang. The computes interprocedural control-flow and data-flow information, should be applicable to any higher-order functional with call-by-value semantics. uses novel method polyvariance, static limiting, where an approximation of call graph is analyzed determine whether function treated as polyvariant or monovariant. A general framework presented. used experimental investigations evaluate cost potential benefits compare different approaches analysis. results show that limiting gives same better precision other analyses, while having more predictable times. However, experiments only small improvements in various analyses.