论文信息 - Expanding Extensional Polymorphism

Expanding Extensional Polymorphism

We prove the confluence and strong normalization properties for second order lambda calculus equipped with an expansive version of η-reduction. Our proof technique, based on a simple abstract lemma and a labelled λ-calculus, can also be successfully used to simplify the proofs of confluence and normalization for first order calculi, and can be applied to various extensions of the calculus presented here.

Roberto Di Cosmo | Adolfo Piperno

[1] Daniel J. Dougherty. Some Lambda Calculi with Categorial Sums and Products , 1993, RTA.

[2] Delia Kesner. La definition de fonctions par cas a l'aide de motifs dans des langages applicatifs , 1993 .

[3] Neil Ghani,et al. The virtues of eta-expansion , 1995, Journal of Functional Programming.

[4] Roberto Di Cosmo,et al. A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object , 1991, ICALP.

[5] Yohji Akama. On Mints' Reduction for ccc-Calculus , 1993, TLCA.

[6] Roberto Di Cosmo,et al. Simulating expansions without expansions , 1994, Mathematical Structures in Computer Science.

[7] Alfons Geser,et al. Relative Termination , 1990 .

[8] Roberto Di Cosmo,et al. Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi , 1994, ICALP.

[9] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .