[Haskell-cafe] Removing alternate items from a list

[Thomas Hartman]

maybe this?

map snd . filter (odd . fst) . zip [1,2..] $ [1,2,3,4,5]

2010/6/6 R J <rj248842 at hotmail.com>:
> What's the cleanest definition for a function f :: [a] -> [a] that takes a
> list and returns the same list, with alternate items removed?  e.g., f [0,
> 1, 2, 3, 4, 5] = [1,3,5]?
>
> ________________________________
> The New Busy is not the old busy. Search, chat and e-mail from your inbox.
> Get started.
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>