(Corrected !!x to !!(x-1))
(There was a mistake in the 4th from last evaluation)
|(2 intermediate revisions by 2 users not shown)|
Revision as of 17:32, 17 September 2008
This question came up in #haskell, and it seemed instructive to take the discussion and sum it up into a simple tutorial on lazy evaluation. For more information, see the Laziness and Strictness pages.
The following code was given:
magic :: Int -> Int -> [Int] magic 0 _ =  magic m n = m : (magic n (m+n)) getIt :: [Int] -> Int -> Int getIt  _ = 0 getIt (x:xs) 1 = x getIt (x:xs) n = getIt xs (n-1)
Analyzing this code a little, we can see that (magic 1 1) is just the fibonacci numbers, namely [1,1,2,3,5,...]. There are, of course, more efficient ways of computing this sequence in haskell, but the important thing here is that it's an infinite list. Now, the person asking wanted to evaluate the following:
getIt (magic 1 1) 3
In this context, of course, getIt (magic 1 1) x is simply (magic 1 1) !! (x - 1). Again, though the important thing in this context that although the evaluation of (magic 1 1) never terminates, the evaluation of this expression in fact does. But if a parameter to a function can never be fully evaluated, how can the full function call ever be evaluated? The answer is: Lazy Evaluation. In this tutorial, we're going to step through this code, and attempt to give an idea of how Haskell will attempt to evaluate the above expression.
The first thing to do is to figure out which pattern in getIt this expression matches. The first pattern only matches if getIt is passed an empty list, and any Int. The 'any Int' part is fine, so we need to know if it's passed an empty list. Answering that question forces one step in the evaluation of (magic 1 1).
getIt (1 : (magic 1 (1+1)) 3
Now it's clear that getIt has not been passed an empty list, since the element has, at least, a head of 1. Thus, this expression will not match the first pattern in getIt. So we look at the second pattern in getIt. Now the non-empty list is fine, but the 3 doesn't match with the 1, so we move to the third pattern. Finally, we have a non-empty list, and any integer, so we will match this pattern. The first 1 gets bound to x, the (magic 1 (1+1)) gets bound to xs, and the 3 gets bound to n. Doing the substitution on the right-hand side yields
getIt (magic 1 (1+1)) (3-1)
Time to find a pattern in getIt to match with again. Looking at the first pattern, it's clear that it doesn't matter what the second argument is, so the question again becomes whether or not the first argument is an empty list or not. This forces another step in the evaluation of magic.
getIt (1 : (magic (1+1) (1+(1+1)))) (3-1)
Now it again becomes clear that we're not talking about an empty list. On to the second pattern in getIt then. Here, the non-empty list is good, and we need to know if the second argument is a 1. This forces an evaluation of (3-1).
getIt (1 : (magic (1+1) (1+(1+1)))) 2
Definitely not a 1. On to the third pattern. A non-empty list is good, and any Int is fine, so 1 gets bound to x, (magic (1+1) (1+(1+1))) to xs, and 2 to n, yielding
getIt (magic (1+1) (1+(1+1))) (2-1)
Again, we need to know whether or not the list is non-empty, forcing the magic call to be expanded. To see if this call matches the first pattern in magic, we must evaluate the first argument, (1+1), giving
getIt (magic 2 (1+(1+1))) (2-1)
The first argument to magic is not 0, so the second pattern is used, yielding
getIt (2 : magic (1+(1+1)) (2+(1+(1+1)))) (2-1)
It's again a non-empty list, so we evaluate the second parameter to find out if it's a 1.
getIt (2 : (magic (1+(1+1)) (2+(1+(1+1)))) 1
It is, so 2 gets bound to x, and (magic (1+(1+1)) (2+(1+(1+1)))) to xs. This yields: