%0 Conference Proceedings
%T Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ -terms
%+ Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243))
%+ Institut de Mathématiques de Marseille (I2M)
%A Pagani, Michele
%A Tasson, Christine
%A Vaux, Lionel
%< avec comité de lecture
%B 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2016)
%C Eindhoven, Netherlands
%I Springer Berlin Heidelberg
%3 Foundations of Software Science and Computation Structures
%V Lecture Notes in Computer Science 9634
%P pp 408-423
%8 2016-04-04
%D 2016
%Z 1603.07218
%Z Computer Science [cs]/Logic in Computer Science [cs.LO]Conference papers
%X 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.
%G English
%2 https://hal.science/hal-01292923/document
%2 https://hal.science/hal-01292923/file/main.pdf
%L hal-01292923
%U https://hal.science/hal-01292923
%~ UNIV-PARIS7
%~ CNRS
%~ UNIV-AMU
%~ EC-MARSEILLE
%~ I2M
%~ I2M-2014-
%~ USPC
%~ UNIV-PARIS
%~ UP-SCIENCES
%~ IRIF