Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Barendregt, H.: Lambda calculi with types. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 117–309. Clarendon Press, Oxford (1992)
2. Berardi, S., Bezem, M., Coquand, T.: On the computational content of the axiom of choice. Journal of Symbolic Logic 63(2), 600–622 (1998)
3. Berger, U.: A computational interpretation of open induction. In: Titsworth, F. (ed.) Proceedings of the Ninetenth Annual IEEE Symposium on Logic in Computer Science, pp. 326–334. IEEE Computer Society, Los Alamitos (2004)
4. Berger, U., Oliva, P.: Modified bar recursion and classical dependent choice. In: Logic Colloquium 2001. Springer, Heidelberg (2001) (to appear)
5. Bezem, M.: Strong normalization of barrecursive terms without using infinite terms. Archive for Mathematical Logic 25, 175–181 (1985)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献