Higher-Order and Symbolic Computation, 12(2)203-212
Partial Evaluation of the Euclidean Algorithm, RevisitedC.S. Lee, Department of Computer Science, University of Western Australia, Nedlands, Western Australia 6009
|
Abstract: The usual formulation of the Euclidean Algorithm is
not well-suited to be specialized with respect to one of its
arguments, at least when using offline partial evaluation. This has
led Danvy and Goldberg to reformulate it using bounded recursion. In
this article, we show how The Trick can be used to obtain a
formulation of the Euclidean Algorithm with good binding-time
separation. This formulation of the Euclidean Algorithm specializes
effectively using standard offline partial evaluation.
Keywords: Euclidean Algorithm, binding-time separation, offline partial evaluation, The Trick |
This article can be downloaded [here].
![[picture of journal cover]](../LISP.JPG)