Computing with functionals - Computability theory or computer science?

Bulletin of Symbolic Logic

Volumn 12, Issue 1, 2006, Pages 43-59

  Normann, Dag ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645373605     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2178/bsl/1140640943     Document Type: Review

References (44)

1. S. ABRAMSKY, R. JAGADEESAN, and P. MALACARIA, Full abstraction for PCF, (extended abstract), Theoretical aspects of computer software (M. Hagiya and J. C. Mitchell, editors), Springer, 1994, pp. 1-15.
2. K. J. BARWISE, Admissible sets and structures, Springer, 1975.
3. U. BERGER, Totale Objekte und Mengen in der Bereichstheorie, Thesis, München, 1990, in German.
4. A. CHURCH, An unsolvable problem in elementary number theory, American Journal of Mathematics, vol. 58 (1936), pp. 345-363.
5. P. DI GIANANTONIO, A functional approach to computability on real numbers, Thesis, Università di Pisa-Genova-Udine, 1993.
6. _, Real number computability and domain theory, Information and Computation. vol. 127 (1996), pp. 11-25.
7. _, An abstract data type for real numbers, Theoretical Computer Science, vol. 221 (1999), pp. 295-326.
8. YU. L. ERSHOV, Computable functionals of finite type, Algebra and Logic, vol. 11 (1972), pp. 203-277.
9. _, The theory of numerations, vol. 2, Novosibirsk, 1973, in Russian.
10. _, Maximal and everywhere defined functionals, Algebra and Logic, vol. 13 (1974), pp. 210-225.
11. J. M. E. HYLAND, Recursion on the countable functionals, Dissertation, Oxford, 1975.
12. J. M. E. HYLAND and C.-H. L. ONG, On full abstraction for PCF. I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model, Information and Computation, vol. 163 (2000), pp. 285-408.
13. S. C. KLEENE, Recursive functional and quantifiers of finite types I, Transactions of the American Mathematical Society, vol. 91 (1959), pp. 1-52.
14. _, Countable functionals, Constructivity in mathematics (A. Heyting, editor), North-Holland, 1959, pp. 81-100.
15. _, Recursive functionals and quantifiers of finite types II, Transactions of the American Mathematical Society, vol. 108 (1963), pp. 106-142.
16. _, Recursive functionals and quantifiers of finite types revisited I, Generalized recursion theory II (J. E. Fenstad, R. O. Gandy, and G. E. Sacks, editors), North-Holland, 1978, pp. 185-222.
17. _, Recursive functionals and quantifiers of finite types revisited II, The Kleene symposium (J. Barwise, H. J. Keisler, andK. Kunen, editors), North-Holland, 1980, pp. 1-29.
18. _, Recursive functionals and quantifiers of finite types revisited III, Fatras logic Symposion (G. Metakides, editor), North-Holland, 1982, pp. 1-40.
19. _, Unimonotone functions of finite types (Recursive functionals and quantifiers of finite types revisited IV), American Mathematical Society proceedings of symposia in pure mathematics (A. Nerode and R. A. Shore, editors), Recursion theory, vol. 42, 1985, pp. 119-138.
20. _, Recursive functionals and quantifiers of finite types revisited V, Transactions of the American Mathecal Society, vol. 325 (1991), pp. 593-630.
21. G. KREISEL, Interpretation of analysis by means of functionals of finite type, Constructivity in mathematics (A. Heyting, editor), North-Holland, 1959, pp. 101-128.
22. C. KURATOWSKI, Topologie, vol. 1, Warsawa, 1952.
23. R. LOADER, Unary PCF is decidable. Theoretical Computer Science, vol. 206 (1998), no. 1-2, pp. 317-329.
24. _, Finitary PCF is not decidable, Theoretical Computer Science, vol. 266 (2001), no. 1-2, pp. 341-364.
25. J. R. LONGLEY, The sequentially realizable functionals, Annals of Pure and Applied Logic, vol. 117, no. 1, pp. 1-93.
26. _, Notions of computability at higher types I, Logic colloquium 2000 (R. Cori et al., editors), Lecture Notes in Logic, vol. 19, ASL and AK Peters, 2005, pp. 32-142.
27. _, On the ubiquity of certain total type structures, Proceedings of workshop in domains VI (Birmingham), Electronic Notes in Theoretical Computer Science, vol. 74, Elsevier, 2003, to appear.
28. R. MILNER, Fully abstract models for typed λ-calculi. Theoretical Computer Science, vol. 4 (1977), pp. 1-22.
29. R. MILNER and C. STRACHEY. A theory of programming language semantics, Chapman and Hall, London, 1976.
30. J. MOLDESTAD, Computations in higher types, Lecture Notes in Mathematics, vol. 574, Springer, 1977.
31. Y. N. MOSCHOVAKIS, Hyperanalytic predicates, Transactions of the American Mathematical Society, vol. 129 (1997), pp. 249-282.
32. D. NORMANN, Set recursion, Generalized recursion theory II (J. E. Fenstad, R. O. Gandy, and G. E. Sacks, editors), North Holland, 1978, pp. 303-320.
33. _, The continuous functionals; computations, recursions and degrees. Annals of Mathematical Logic, vol. 21 (1981), pp. 1-26.
34. _, Computability over the partial continuous functionals, The Journal of Symbolic Logic, vol. 65 (2000), pp. 1133-1142.
35. _, On sequential functional of type 3, Mathematical structures in Computer Science, to appear.
36. R. A. PLATEK, Foundations of recursion theory, Thesis, Stanford University, 1966.
37. G. PLOTKIN, LCF considered as a programming language, Theoretical Computer Science, vol. 5 (1977), pp. 223-255.
38. _, Full abstraction, totality and PCF, Mathematical Structures in Computer Science, vol. 11 (1999), pp. 1-20.
39. G. E. SACKS, Higher recursion theory, Springer, 1990.
40. D. SCOTT, A type-theoretical alternative to ISWIM, CUCH, OWHY, unpublished notes, 1969, Oxford.
41. _, A type-theoretical alternative to ISWIM, CUCH, OWHY, Theoretical Computer Science, vol. 121 (1993), pp. 411-440.
42. A. SIMPSON, Lazy functional algorithms for exact real functionals, Mathematical foundations of computer science, 1998, Lecture Notes in Computer Science, vol. 1450, Springer, 1998, pp. 456-464.
43. W. W. TAIT, Continuity properties of partial recursive functional of finite type, unpublished notes, 1958.
44. J. V. TUCKER and J. I. ZUCKER, Abstract versus concrete models of computation on partial metric algebras, ACM Transactions on Computational Logic, accepted.