Inversion by Partial Evaluation: A Reversible Interpreter Experiment
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929615087337472 |
|---|---|
| author | Glück, Robert Normann, Louis Marott |
| author_facet | Glück, Robert Normann, Louis Marott |
| contents | A computational limit of combining partial evaluation and program inversion is investigated. Using a reversible Turing machine interpreter, we show that the first Futamura and inversion projections can produce not only functionally but also textually equivalent programs. The construction of the interpreter in a reversible flowchart language is shown in full. Insights are provided on the practical interplay between reversible interpreters, program inverters, and partial evaluators. We conclude that both projections must be included in the program transformation toolbox. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_03122 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Inversion by Partial Evaluation: A Reversible Interpreter Experiment Glück, Robert Normann, Louis Marott Programming Languages Formal Languages and Automata Theory D.3.4; F.1.1; F.3.2 A computational limit of combining partial evaluation and program inversion is investigated. Using a reversible Turing machine interpreter, we show that the first Futamura and inversion projections can produce not only functionally but also textually equivalent programs. The construction of the interpreter in a reversible flowchart language is shown in full. Insights are provided on the practical interplay between reversible interpreters, program inverters, and partial evaluators. We conclude that both projections must be included in the program transformation toolbox. |
| title | Inversion by Partial Evaluation: A Reversible Interpreter Experiment |
| topic | Programming Languages Formal Languages and Automata Theory D.3.4; F.1.1; F.3.2 |
| url | https://arxiv.org/abs/2412.03122 |