Abstract
In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context of the non-deterministic λ-calculus by introducing a finiteness structure on resource terms, which is such that a λ-term is strongly normalizing iff the support of its Taylor expansion is finitary. An application of our result is the existence of a normal form for the Taylor expansion of any strongly normalizable non-deterministic λ-term.
Cite
CITATION STYLE
Pagani, M., Tasson, C., & Vaux, L. (2016). Strong normalizability as a finiteness structure via the Taylor expansion of λ-terms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9634, pp. 408–423). Springer Verlag. https://doi.org/10.1007/978-3-662-49630-5_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.