D. Norman, Recursion on the Countable Functionals, Springer (1980), LNM 811 Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A Combinatory Algebra for Sequential Functionals of Finite Type - van Oosten (1997) (8 citations) (Correct)
....common with the full abstraction problem for PCF . As far as I am aware however, the exact relationship between Kleene s work and the work on PCF still remains to be clarified. An important model of Kleene s axioms is provided by the so called continuous (or countable) functionals (see, e.g. [15]) They arise, in a standard way, as the type structure coming from the partial combinatory algebra of Kleene s function realizability (introduced in [14] This is a partial combinatory algebra structure on the set of functions from IN to IN. A surprising result of this paper is, that a natural ....
D. Norman, Recursion on the Countable Functionals, Springer (1980), LNM 811
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC