Limiting partial combinatory algebras

From every partial combinatory algebra A we construct another partial combinatory algebra a-lim(A). In a-lim(A), every representable partial numerical function φ(n) is exactly of the form limtζ(t, n) for some representable partial numerical function ζ(t, n) of A. The partial combinatory algebra a-lim(A) is a quotient of A by a partial equivalence relation, and is equipped with a limit structure in the sense that each element of a-lim(A) is the limit of a countable sequence of A-elements. In this paper, we discuss the limit structures for A in terms of Barendregt's range property (if the range of a combinator is finite, then it is a singleton). Moreover, we repeat the construction a-lim(-) transfinite times to interpret infinitary λ-calculi. Finally, we attempt to interpret type-free λµ-calculus by introducing another partial applicative structure which has an asynchronous application operator that allows a parallel limit operation.