Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.11297 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916901329829888 |
|---|---|
| author | Bach, Casper |
| author_facet | Bach, Casper |
| contents | Reduction-based interpreters are traditionally defined in terms of a one-step reduction function which systematically decomposes a term into a potential redex and context, contracts the redex, and recomposes it to construct the new term to be further reduced. While implementing such interpreters follows a systematic recipe, they often require interpreter engineers to write a substantial amount of code -- much of it boilerplate. In this paper, we apply well-known techniques from generic programming to reduce boilerplate code in reduction-based interpreters. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_11297 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Generic Reduction-Based Interpreters (Extended Version) Bach, Casper Programming Languages Reduction-based interpreters are traditionally defined in terms of a one-step reduction function which systematically decomposes a term into a potential redex and context, contracts the redex, and recomposes it to construct the new term to be further reduced. While implementing such interpreters follows a systematic recipe, they often require interpreter engineers to write a substantial amount of code -- much of it boilerplate. In this paper, we apply well-known techniques from generic programming to reduce boilerplate code in reduction-based interpreters. |
| title | Generic Reduction-Based Interpreters (Extended Version) |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2508.11297 |