论文信息 - Binding-time analysis applied to mathematical algorithms

Binding-time analysis applied to mathematical algorithms

Our goal is to incorporate state-of-the-art partial evaluation in a library of general-purpose algorithms — in particular, mathematical algorithms — in order to allow the automatic creation of efficient, special-purpose programs. The main goal is efficiency: a specialized program often runs significantly faster than its generic version.

Robert Glück | Robert Zöchling | Ryo Nakashige

[1] J. Douglas Faires,et al. Numerical Analysis , 1981 .

[2] Peter Sestoft,et al. Partial evaluation and automatic program generation , 1993, Prentice Hall international series in computer science.

[3] William H. Press,et al. Numerical recipes in C. The art of scientific computing , 1987 .

[4] Robert Metzger,et al. Interprocedural constant propagation: an empirical study , 1993, LOPL.

[5] Chris Goad,et al. Automatic Construction of Special Purpose Programs , 1982, CADE.

[6] Robert Glück,et al. Partial Evaluation of Numerical Programs in Fortran , 1994, PEPM.

[7] William H. Press,et al. Book-Review - Numerical Recipes in Pascal - the Art of Scientific Computing , 1989 .

[8] Fred G. Gustavson,et al. Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations , 1970, JACM.

[9] Andrew A. Berlin,et al. Compiling scientific code using partial evaluation , 1990, Computer.

[10] W. Cheney,et al. Numerical analysis: mathematics of scientific computing (2nd ed) , 1991 .

[11] Robert Glück,et al. Fortran program specialization , 1995, SIGP.

[12] Peter Holst Andersen. Partial Evaluation Applied to Ray Tracing , 1996 .