Stablishing termination of the construction of infinite stream with ranking functions

Question

I'm working with Turing's paradigm to prove termination of programs by annotating functions with ranking functions and I encounter the following example:

def zeros: Stream[Int] = 0 #:: zeros

This is Scala syntax for contructing a stream made of an infinite number of zeros. In this case, the evaluation terminates but there is no (evident) measure that would prove it so?

Does this mean that the ranking functions paradigm is limited? Or is there a function stablishing termination of zeros?

• Turing, A. Checking a large routine. In Report of a Conference on High Speed Automatic Calculating Machines, 1949.