=. For-i and ?. , n k?1 p k?1 ? s n k 0.?.? Â Â ? ? s p k 0.? n 1 p 1 ...n k p k .? 0 . For i = k no reduction is possible

]. S. Berardi, M. Bezem, and T. Coquand, Abstract, The Journal of Symbolic Logic, vol.39, issue.02, pp.600-622, 1998.
DOI : 10.1007/BF02007566

U. Berger and P. Oliva, Modified bar recursion and classical dependent choice (preprint)
DOI : 10.1017/9781316755860.004
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.9474

T. Coquand, A semantics of evidence for classical arithmetic, The Journal of Symbolic Logic, vol.54, issue.01, pp.325-337, 1995.
DOI : 10.1007/BFb0079691

J. Girard, Une extension de l'interprétation de Gödeì a l'analyse, Proc. 2nd

T. Griffin, A formulae-as-type notion of control, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, 1990.
DOI : 10.1145/96709.96714

U. Kohlenbach, Abstract, The Journal of Symbolic Logic, vol.36, issue.04, pp.1491-1511, 1999.
DOI : 10.1090/pspum/005/0154801

J. Krivine, A general storage theorem for integers in call-by-name ??-calculus, Theoretical Computer Science, vol.129, issue.1, pp.79-94, 1994.
DOI : 10.1016/0304-3975(94)90081-7

J. Krivine, Typed lambda-calculus in classical Zermelo-Fr??nkel set theory, Archive for Mathematical Logic, vol.40, issue.3, pp.189-205, 2001.
DOI : 10.1007/s001530000057

M. Parigot, ?µ-calculus: an algorithmic interpretation of classical natural deduction, Proc. Logic Progr. and Autom. Reasoning, St Petersbourg. L.N.C.S, vol.624, pp.190-201, 1992.

J. R. Shoenfield, Mathematical logic, 1967.

G. Takeuti, Proof Theory, Studies in Logic and Foundations of Mathematics, 1987.