Since 2014
Partial Evaluation of the Euclidian Algorithm (Extended Version)
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Partial Evaluation of the Euclidian Algorithm (Extended Version)
|
|
| Creator |
Danvy, Olivier
Goldberg, Mayer |
|
| Description |
Some programs are easily amenable to partial evaluation becausetheir control flow clearly depends on one of their parameters. Specializingsuch programs with respect to this parameter eliminates theassociated interpretive overhead. Some other programs, however, donot exhibit this interpreter-like behavior. Each of them presents a challengefor partial evaluation. The Euclidian algorithm is one of them,and in this article, we make it amenable to partial evaluation.We observe that the number of iterations in the Euclidian algorithmis bounded by a number that can be computed given either of the twoarguments. We thus rephrase this algorithm using bounded recursion.The resulting program is better suited for automatic unfolding andthus for partial evaluation. Its specialization is efficient.Keywords: partial evaluation, scientific computation.
|
|
| Publisher |
Aarhus University
|
|
| Date |
1997-01-01
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/18780
10.7146/brics.v4i1.18780 |
|
| Source |
BRICS Report Series; No 1 (1997): RS-01 Partial Evaluation of the Euclidian Algorithm (Extended Version)
BRICS Report Series; Nr. 1 (1997): RS-01 Partial Evaluation of the Euclidian Algorithm (Extended Version) 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/18780/16427
|
|