Staff – University of Copenhagen

A self-applicable online partial evaluator for recursive flowchart languages

Research output: Contribution to journalJournal articleResearchpeer-review

Standard

A self-applicable online partial evaluator for recursive flowchart languages. / Glück, Robert.

In: Software: Practice & Experience, Vol. 42, No. 6, 2012, p. 649-673.

Research output: Contribution to journalJournal articleResearchpeer-review

Harvard

Glück, R 2012, 'A self-applicable online partial evaluator for recursive flowchart languages' Software: Practice & Experience, vol. 42, no. 6, pp. 649-673. https://doi.org/10.1002/spe.1086

APA

Glück, R. (2012). A self-applicable online partial evaluator for recursive flowchart languages. Software: Practice & Experience, 42(6), 649-673. https://doi.org/10.1002/spe.1086

Vancouver

Glück R. A self-applicable online partial evaluator for recursive flowchart languages. Software: Practice & Experience. 2012;42(6):649-673. https://doi.org/10.1002/spe.1086

Author

Glück, Robert. / A self-applicable online partial evaluator for recursive flowchart languages. In: Software: Practice & Experience. 2012 ; Vol. 42, No. 6. pp. 649-673.

Bibtex

@article{5f1d39a97f284574b6de6d693fb6b344,
title = "A self-applicable online partial evaluator for recursive flowchart languages",
abstract = "This paper describes a self-applicable online partial evaluator for a ¿owchart language with recursive calls.Self-application of the partial evaluator yields generating extensions that are as ef¿cient as those reported inthe literature for of¿ine partial evaluation. This result is remarkable because it has been assumed that onlinepartial evaluation techniques unavoidably lead to inef¿cient and overgeneralized generating extensions. Thepurpose of this paper is not to determine which kind of partial evaluation is better, but to show how theproblem can be solved by recursive polyvariant specialization. The design of the self-applicable onlinepartial evaluator is based on a number of known techniques, but by combining them in a new way thisresult can be produced. The partial evaluator, its techniques, and its implementation are presented in full.Self-application according to all three Futamura projections is demonstrated. The complete bootstrap of acompiler generator from a partial evaluator is also reported. Copyright q 2011 John Wiley & Sons, Ltd.",
author = "Robert Gl{\"u}ck",
year = "2012",
doi = "10.1002/spe.1086",
language = "English",
volume = "42",
pages = "649--673",
journal = "Software: Practice & Experience",
issn = "0038-0644",
publisher = "JohnWiley & Sons Ltd",
number = "6",

}

RIS

TY - JOUR

T1 - A self-applicable online partial evaluator for recursive flowchart languages

AU - Glück,Robert

PY - 2012

Y1 - 2012

N2 - This paper describes a self-applicable online partial evaluator for a ¿owchart language with recursive calls.Self-application of the partial evaluator yields generating extensions that are as ef¿cient as those reported inthe literature for of¿ine partial evaluation. This result is remarkable because it has been assumed that onlinepartial evaluation techniques unavoidably lead to inef¿cient and overgeneralized generating extensions. Thepurpose of this paper is not to determine which kind of partial evaluation is better, but to show how theproblem can be solved by recursive polyvariant specialization. The design of the self-applicable onlinepartial evaluator is based on a number of known techniques, but by combining them in a new way thisresult can be produced. The partial evaluator, its techniques, and its implementation are presented in full.Self-application according to all three Futamura projections is demonstrated. The complete bootstrap of acompiler generator from a partial evaluator is also reported. Copyright q 2011 John Wiley & Sons, Ltd.

AB - This paper describes a self-applicable online partial evaluator for a ¿owchart language with recursive calls.Self-application of the partial evaluator yields generating extensions that are as ef¿cient as those reported inthe literature for of¿ine partial evaluation. This result is remarkable because it has been assumed that onlinepartial evaluation techniques unavoidably lead to inef¿cient and overgeneralized generating extensions. Thepurpose of this paper is not to determine which kind of partial evaluation is better, but to show how theproblem can be solved by recursive polyvariant specialization. The design of the self-applicable onlinepartial evaluator is based on a number of known techniques, but by combining them in a new way thisresult can be produced. The partial evaluator, its techniques, and its implementation are presented in full.Self-application according to all three Futamura projections is demonstrated. The complete bootstrap of acompiler generator from a partial evaluator is also reported. Copyright q 2011 John Wiley & Sons, Ltd.

U2 - 10.1002/spe.1086

DO - 10.1002/spe.1086

M3 - Journal article

VL - 42

SP - 649

EP - 673

JO - Software: Practice & Experience

T2 - Software: Practice & Experience

JF - Software: Practice & Experience

SN - 0038-0644

IS - 6

ER -

ID: 38113374