1. Plotkin, G.: LCF considered as a programming language. Theoretical Computer Science 5, 223–255 (1977)
2. Lecture Notes in Computer Science;U. Berger,2005
3. Berger, U.: Strong normalization for applied lambda calculi. Submitted to: Logical Methods in Computer Science, January 2005 (2005)
4. Spector, C.: Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics. In: Dekker, F.D.E. (ed.) Recursive Function Theory: Proc. Symposia in Pure Mathematics, vol. 5, pp. 1–27. American Mathematical Society, Providence (1962)
5. Howard, W.A.: Functional interpretation of bar induction by bar recursion. Composito Mathematicae 20, 107–124 (1968)