Spring til hovednavigation Spring til søgning Spring til hovedindhold

Generic Reduction-Based Interpreters

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

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.

OriginalsprogEngelsk
TitelOLIVIERFEST 2025 - Proceedings of the Workshop Dedicated to Olivier Danvy on the Occasion of His 64th Birthday
RedaktørerFritz Henglein, Julia Lawall, Jens Palsberg, Sergey Ilya
ForlagAssociation for Computing Machinery
Publikationsdato12. okt. 2025
Sider166-179
ISBN (Elektronisk)9798400721502
DOI
StatusUdgivet - 12. okt. 2025
Begivenhed2025 Workshop Dedicated to Olivier Danvy on the Occasion of His 64th Birthday, OLIVIERFEST 2025 - Singapore, Singapore
Varighed: 12. okt. 202518. okt. 2025

Konference

Konference2025 Workshop Dedicated to Olivier Danvy on the Occasion of His 64th Birthday, OLIVIERFEST 2025
Land/OmrådeSingapore
BySingapore
Periode12/10/202518/10/2025
SponsorACM 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