User loginNavigation |
using foldr to do mapI am reading Hutton's book, programming in Haskell, and got stumped by a question. redefine map f using foldr. Since foldr is described as replacing (:) in a list with some provided operator it seemed it shouldn't be too hard. So I tried this: > folmap :: (a -> b) -> [a] -> [b] My reasoning is that you apply the : operator after f on every value in the list. (Though I may not understand the (.) I was thinking that if f = (a ->b) and g = (b -> c) then g.f would be g performed after f (or g.f is f followed by g). Any advice?? By jdgallag at 2008-06-10 16:57 | LtU Forum | previous forum topic | next forum topic | other blogs | 8209 reads
|
Browse archivesActive forum topics |
Recent comments
8 weeks 2 days ago
8 weeks 4 days ago
8 weeks 6 days ago
15 weeks 5 days ago
21 weeks 3 days ago
21 weeks 4 days ago
22 weeks 3 days ago
25 weeks 2 days ago
26 weeks 5 days ago
26 weeks 5 days ago