Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Berger, U., Oliva, P.: Modified Bar Recursion and Classical Dependent Choice. Lecture Notes in Logic 20, 89–107 (2005)
2. Brattka, V.: Recursive characterisation of computable real-valued functions and relations. Theoret. Comput. Sci. 162, 47–77 (1996)
3. Briggs, K.: Implementing exact real arithmetic in python, C++ and C (to appear in Journal of theoretical computer science), See also http://more.btexact.com/people/briggsk2/xrc.html
4. Buss, S.R., Kapron, B.M.: Resource-bounded continuity and sequentiality for type-two functionals. ACM Transactions on Computational Logic 3(3), 402–417 (7/2002)
5. Cook, S.A., Kapron, B.M.: Characterizations of the basic feasible functionals of finite type. In: Buss, S., Scott, P. (eds.) Feasible Mathematics: A Mathematical Sciences Institute Workshop, Birkhauser, pp. 71–96 (1990)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献