Electronic Resource
Springer
Higher-order and symbolic computation
12 (1999), S. 203-212
ISSN:
1573-0557
Keywords:
Euclidean Algorithm
;
binding-time separation
;
offline partial evaluation
;
The Trick
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1010004307057
Permalink
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
