{-# OPTIONS_GHC -O2 -fno-cse #-}
primesTME = 2 : gaps 3 (joinT [[p*p, p*p+2*p..] | p <- primes']) 
  where
    primes' = 3 : gaps 5 (joinT -- [[p*p, p*p+2*p..] | p <- primes'])
                  [map (p*) $ scanl (+) p (cycle[2]) | p <- primes'])  
 
joinT ((x:xs):t) = x : union xs (joinT (pairs t))  
pairs ((x:xs):ys:t) = (x : union xs ys) : pairs t 
gaps k s@(x:xs) | k<x  = k:gaps (k+2) s    -- equivalent to
                | True =   gaps (k+2) xs   --  [k,k+2..]`minus`s, k<=head s

main = mapM_ print 
         . take 10 . map fst 
         . tail . iterate (splitAt 10.snd)
         $ ([],take 100 primesTME)

union (x:xs) (y:ys) = case (compare x y) of 
           LT -> x : union  xs  (y:ys)
           EQ -> x : union  xs     ys 
           GT -> y : union (x:xs)  ys