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>
[1] Bernhard Rytz,et al. A Polyvariant Binding Time Analysis , 1992, PEPM.
[2] John Launchbury,et al. Projection factorisations in partial evaluation , 1991 .
[3] R. Kent Dybvig,et al. The Scheme Programming Language , 1995 .
[4] Mikhail A. Bulyonkov. From Partial Evaluation to Mixed Computation , 1991, Theor. Comput. Sci..