English

Normalization, Taylor expansion and rigid approximation of $\lambda$-terms

Logic in Computer Science 2020-01-07 v1

Abstract

The aim of this work is to characterize three fundamental normalization proprieties in lambda-calculus trough the Taylor expansion of λ \lambda-terms. The general proof strategy consists in stating the dependence of ordinary reduction strategies on their resource counterparts and in finding a convenient resource term in the Taylor expansion that behaves well under the considered kind of reduction.

Keywords

Cite

@article{arxiv.2001.01619,
  title  = {Normalization, Taylor expansion and rigid approximation of $\lambda$-terms},
  author = {Federico Olimpieri},
  journal= {arXiv preprint arXiv:2001.01619},
  year   = {2020}
}
R2 v1 2026-06-23T13:04:00.930Z