Strong Normalizability as a Finiteness Structure via the Taylor Expansion of {λ}-terms
classification
💻 cs.LO
keywords
lambdaexpansionfinitenessstructuretaylorintuitionnon-deterministicstrong
read the original 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 {\lambda}-calculus by introducing a finiteness structure on resource terms, which is such that a {\lambda}-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 {\lambda}-term.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.