functional programming for Primes, inspired by Haskell example

primes.py

# !encoding=utf8
# primes = filterPrime [2..] 
#   where filterPrime (p:xs) = 
#           p : filterPrime [x | x <- xs, x `mod` p /= 0]

# Infinite List
from pipe import *
from pipe import itertools

def primes(xs):
    while 1:
        p = next(xs)
        yield p
        xs = (lambda xs, p: (x for x in xs if x % p != 0))(xs, p)

print primes(itertools.count(2)) | take(25) | as_list

# Finite List
def rc(s):
    return [s[0]] + rc([x for x in s[1:] if x % s[0] != 0]) if len(s) > 1 else []

print rc(range(2, 103))