More Precise Yet Efficient Type Inference for Logic Programs
<|reference_start|>More Precise Yet Efficient Type Inference for Logic Programs: Type analyses of logic programs which aim at inferring the types of the program being analyzed are presented in a unified abstract interpretation-based framework. This covers most classical abstract interpretation-based type analyzers for logic programs, built on either top-down or bottom-up interpretation of the program. In this setting, we discuss the widening operator, arguably a crucial one. We present a new widening which is more precise than those previously proposed. Practical results with our analysis domain are also presented, showing that it also allows for efficient analysis.<|reference_end|>
@article{vaucheret2002more,
    title={More Precise Yet Efficient Type Inference for Logic Programs},
    author={Claudio Vaucheret, Francisco Bueno},
    journal={arXiv preprint arXiv:cs/0207049},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0207049},
    primaryClass={cs.SE}
}