English

From Self-Interpreters to Normalization by Evaluation

Programming Languages 2009-11-24 v1 Logic in Computer Science

Abstract

We characterize normalization by evaluation as the composition of a self-interpreter with a self-reducer using a special representation scheme, in the sense of Mogensen (1992). We do so by deriving in a systematic way an untyped normalization by evaluation algorithm from a standard interpreter for the ?-calculus. The derived algorithm is not novel and indeed other published algorithms may be obtained in the same manner through appropriate adaptations to the representation scheme.

Keywords

Cite

@article{arxiv.0911.4203,
  title  = {From Self-Interpreters to Normalization by Evaluation},
  author = {Mathieu Boespflug},
  journal= {arXiv preprint arXiv:0911.4203},
  year   = {2009}
}
R2 v1 2026-06-21T14:14:33.255Z