The SCHEME programming language
The SCHEME programming language
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Partial Evaluation of the Euclidian Algorithm
Lisp and Symbolic Computation
Writing efficient programs
Revised Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
Program Termination Analysis in Polynomial Time
GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Finiteness Analysis in Polynomial Time
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Program termination analysis in polynomial time
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
The usual formulation of the Euclidean Algorithm is notwell-suited to be specialized with respect to one of itsarguments, at least when using offline partial evaluation. Thishas led Danvy and Goldberg to reformulate it using boundedrecursion. In this article, we show how The Trick can beused to obtain a formulation of the Euclidean Algorithm with goodbinding-time separation. This formulation of the EuclideanAlgorithm specializes effectively using standard offline partialevaluation.