2000 character limit reached
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ-terms
Published 23 Mar 2016 in cs.LO | (1603.07218v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.