CW 518

Tom Schrijvers, John Gallagher, Maurice Bruynooghe
From monomorphic to polymorphic well-typings and beyond. Extended report

Abstract

Automatic well-typing inference for untyped logic programs is useful for error detection, optimized compilation, termination analysis, \ldots Existing inferences are either cheap and inaccurate, or accurate and expensive. We propose a novel SCC-based analysis that is a compromise between accuracy and computational cost. This technical report contains additional experimental results.

report.pdf (179K) / mailto: T. Schrijvers