Extracting polyvariant binding time analysis from polyvariant specializer

Polyvariant binding time analysis allows a program to betransformed for improving propagation and usage of static information.It could be a useful instrument for better specializability. We showthat the process of such a transformation is of the same nature as thewhole specialization process. Moreover, we present a practical methodfor realizing polyvariant binding time analysis based on the doubleapplication of a polyvariant specializer. The proposed technique isrestricted to first order programs with strict semantics. <abstrbyl>—<?Pub Fmt italic>Author's Abstract<?Pub Fmt /italic></abstrbyl>