Project Euler Problem 2 in Haskell Recursive Implementation and List Comprehensions, In Python Imperitive implementation

euler_p2_fp.hs

--Haskell using recursion
problem2_fp = fibblte_h 4000000 1 1 0
	where fibblte_h x y z s
		| y + z >= x = ns
		| otherwise  = fibblte_h x z (y + z) ns
		where ns
			| even (y + z) = s + y + z
			| otherwise    = s

euler_p2_imp.py

# Python Imperative Implementation
def problem2_imp():
	sum = 0
	current = prev = 1
	four_million = 4e6
	while current <= four_million:
		newcurrent = prev + current;
		prev = current;
		current = newcurrent;
		if newcurrent % 2 == 0:
			sum += newcurrent
	return sum

euler_p2_lc_.hs

-- Haskell using List Comprehensions
fibb 0 = 1
fibb 1 = 1
fibb x = (fibb (x - 2) ) + (fibb (x - 1))
problem2_lc = sum ( takeWhile (<=4000000) [ fibb x | x <- [1..], even (fibb x) ])