Abstract

We show that to every recursive total continuous functional there is a representative of in the hierearchy of partial continuous funcriohals such that is S1 - S9 computable over the hierarchy of partial continuous functionals. Equivalently, the representative will be PCF-definable over the partial continuous functionals, where PCF is Plotkin's programming language for computable functionals.

Citations

51	Recursive functionals and quantifiers of finite types - Kleene - 1959
39	Countable functionals - Kleene - 1959
21	Interpretation of Analysis by means of Functionals of Finite Type - Kreisel - 1959
19	Totale Objekte und Mengen in der Bereichstheorie - Berger - 1990
12	Total sets and objects in domain theory, Annals of Pure and Applied Logic 60 - Berger - 1993
9	The continuous functionals - Normann - 1999
6	The hereditarily partial effective functionals and recursion theory in higher types - Longo, Moggi - 1984
4	Computations in Higher Types - Moldestad - 1977
2	Comments On Two Notions Of Higher Type Computability, Unpublished notes - Bellantoni - 1990
1	Computable functionals of finite type, Algebra and Logic 11 - unknown authors - 1972
1	Filterspaces and continuous functionals - E - 1979
1	Computation in Higher Types Springer - Moldestad - 1977
1	Comments On Two Notions Of Higher Type Computability, Unpublished notes - Bcllantoni - 1990