Abstract
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.
| Originalsprog | Engelsk |
|---|---|
| Titel | OLIVIERFEST 2025 - Proceedings of the Workshop Dedicated to Olivier Danvy on the Occasion of His 64th Birthday |
| Redaktører | Fritz Henglein, Julia Lawall, Jens Palsberg, Sergey Ilya |
| Forlag | Association for Computing Machinery |
| Publikationsdato | 12. okt. 2025 |
| Sider | 166-179 |
| ISBN (Elektronisk) | 9798400721502 |
| DOI | |
| Status | Udgivet - 12. okt. 2025 |
| Begivenhed | 2025 Workshop Dedicated to Olivier Danvy on the Occasion of His 64th Birthday, OLIVIERFEST 2025 - Singapore, Singapore Varighed: 12. okt. 2025 → 18. okt. 2025 |
Konference
| Konference | 2025 Workshop Dedicated to Olivier Danvy on the Occasion of His 64th Birthday, OLIVIERFEST 2025 |
|---|---|
| Land/Område | Singapore |
| By | Singapore |
| Periode | 12/10/2025 → 18/10/2025 |
| Sponsor | ACM Special Interest Group on Ada Programming Language, ACM Special Interest Group on Programming Languages |
Fingeraftryk
Dyk ned i forskningsemnerne om 'Generic Reduction-Based Interpreters'. Sammen danner de et unikt fingeraftryk.Citationsformater
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver