论文信息 - The Inf Function in the System F

The Inf Function in the System F

Abstract We give a λ term of type Nat, Nat → Nat in the system F that computes the minimum of 2 Church numerals in time O(inf.log(inf)). This refutes a conjecture of the “λ folklore”.

René David

[1] Jean-Louis Krivine,et al. Opérateurs de mise en mémoire et traduction de Gödel , 1990, Arch. Math. Log..

[2] Michel Parigot,et al. Programming with Proofs , 1990, J. Inf. Process. Cybern..

[3] Michel Parigot. Recursive Programming with Proofs , 1992, Theor. Comput. Sci..

[4] Harold T. Hodes,et al. The | lambda-Calculus. , 1988 .

[5] J. Krivine. Lambda-calcul : types et modèles , 1990 .

[6] Karim Nour. Operateurs de mise en memoire en lambda-calcul pur et type , 1993 .

[7] Michel Parigot. On the Representation of Data in Lambda-Calculus , 1989, CSL.