Myhill-Shepherdson property in recursive function theory states that extensional effective program transformations determine continuous operations on partial functions. Case showed that this property fails to characterize acceptability of numberings of partial recursive functions. In this note we present a higher type analogue to Myhill-Shepherdson property. Our purpose is to show that higher type Myhill-Shepherdson property characterizes weak acceptability under a natural condition.

Every acceptable numbering of an effective domain is complete. Hence every effective domain admits the 2nd recursion theorem of Eršov[1]. On the other hand for every effective domain, the 1st recursion theorem holds. In this note, we establish that for effective domains, the 2nd recursion theorem is strictly more general than the 1st recursion theorem, a generalization of an important result in recursive function theory.