Demand-driven type analysis for dynamically-typed functional languages

摘要: We present a new static type analysis for dynamically-typed languages that produces high quality results at cost remains practicable. The has the ability to adapt needs of optimiser and characteristics program hand. result is an analyser quickly transforms itself be better equipped attack program. Experiments show our approach can pretty clever in optimisations it enables. The adaptable because accomplished using parametric Many properties framework are presented proved dissertation. Among which there guarantee termination any instance produces, capacity analyse perfectly well error-free terminating programs, mimic many conventional analyses. are realised through use demands demand processing rules. Demands express request demonstration property deemed useful optimiser. rules allow directly translated into precise proposals modifications potentially helpful ensure pertinent other demands. A complete demand-driven based on pattern-matching exposed been implemented. prototype implementing demonstrated work great potential. Further research conducted make method usable everyday compilers. Still, this understandable, considering whole work, except notions related analysis, original material.