Haskell/Solutions/Denotational semantics

Remember that:

power2 0 = 1 power2 n = 2 * power2 (n-1)

First, we need to consider whether  is   or not. Using similar reasoning to the  case, we can determine that   is indeed. From there, we know that  is. Since this recurses indefinitely, it is equivalent to.