There are other ways of making possible the assertion that a program can execute forever. For instance, Danecki [1984a] proposed a predicate sloop to qualify programs that can enter in strong loops, that is: