Strong Normalizability as a Finiteness Structure via the Taylor Expansion of \lambda λ -terms

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.

[1]  Jean-Louis Krivine,et al.  Lambda-calculus, types and models , 1993, Ellis Horwood series in computers and their applications.

[2]  Thomas Ehrhard,et al.  Finiteness spaces , 2005, Mathematical Structures in Computer Science.

[3]  Steffen van Bakel,et al.  Complete Restrictions of the Intersection Type Discipline , 1992, Theor. Comput. Sci..

[4]  Minjie Zhang,et al.  Partners Selection in Multi-Agent Systems by Using Linear and Non-linear Approaches , 2008, Trans. Comput. Sci..

[5]  Thomas Ehrhard,et al.  Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms , 2006, CiE.

[6]  Giulio Manzonetto,et al.  Weighted Relational Models of Typed Lambda-Calculi , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[7]  Mariangiola Dezani-Ciancaglini,et al.  A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.

[8]  Michele Pagani,et al.  Visible acyclic differential nets, Part I: Semantics , 2012, Ann. Pure Appl. Log..

[9]  Michele Pagani,et al.  The Cut-Elimination Theorem for Differential Nets with Promotion , 2009, TLCA.

[10]  François Lamarche,et al.  Quantitative Domains and Infinitary Algebras , 1992, Theor. Comput. Sci..

[11]  Thomas Ehrhard,et al.  Uniformity and the Taylor expansion of ordinary lambda-terms , 2008, Theor. Comput. Sci..

[12]  Thomas Ehrhard.  A Finiteness Structure on Resource Terms , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[13]  Laurent Regnier,et al.  The differential lambda-calculus , 2003, Theor. Comput. Sci..