How do you solve this Haskell problem using higher order functions?

Posted by Linda Cohen on Stack Overflow See other posts from Stack Overflow or by Linda Cohen
Published on 2010-05-06T00:55:16Z Indexed on 2010/05/06 0:58 UTC
Read the original article Hit count: 288

Filed under:

haskell

|

higher-order-functions

|

map

|

fold

Using higher order functions (map, fold or filter) and if necessary lambda expressions. Write a definition for f1 and f2 so the following evaluation is valid:

f1 (f2 (*) [1,2,3,4]) 5
output: [5,10,15,20]

Any help would be appreciated, thanks.

© Stack Overflow or respective owner

Related posts about haskell

Learning Haskell: How to remove an item from a List in Haskell

as seen on Stack Overflow - Search for 'Stack Overflow'
Trying to learn Haskell. I am trying to write a simple function to remove a number from a list without using built-in function (delete...I think). For the sake of simplicity, let's assume that the input parameter is an Integer and the list is an Integer list. Here is the code I have, Please tell me… >>> More
Using Data.Heap in Haskell, or reading Haskell docs for a beginner

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm trying to use Haskells Data.Heap module, but I'm incapable of even using it with integers. The only heap I've been capable of using is "empty", which does not take any arguments. Later on I'll figure out how to instance for my needs, but for now I'd be glad if I was even able to test it with… >>> More
What kind of things are easy in Haskell and hard in Scala, and vice versa?

as seen on Programmers - Search for 'Programmers'
There has been some intermingling of Scala and Haskell communities, and I have noticed now and then people commenting on stuff that's supposed to be easy in Haskell and hard and Scala. Less often (maybe because I read Scala questions, not Haskell ones), I see someone mentioning that something in Scala… >>> More
Haskell's cabal dependency problem with happy

as seen on Programmers - Search for 'Programmers'
I have problems installing ghc-mod on my linux machine. cabal worries about "happy" not being available in versione = 1.17: $ cabal install ghc-mod Resolving dependencies... [1 of 1] Compiling Main ( /tmp/haskell-src-exts-1.14.0-1357/haskell-src-exts-1.14.0/Setup.hs, /tmp/haskell-src-exts-1… >>> More
Understanding Haskell's fibonacci

as seen on Stack Overflow - Search for 'Stack Overflow'
fibs :: [Int] fibs = 0 : 1 : [ a + b | (a, b) <- zip fibs (tail fibs)] This generates the Fibonacci sequence. I understand the behaviour of the guards, of :, zip and tail, but I don't understand <-. What is it doing here? >>> More

Related posts about higher-order-functions

Higher order functions in C

as seen on Stack Overflow - Search for 'Stack Overflow'
Is there a "proper" way to implement higher order functions in C. I'm mostly curious about things like portability and syntax correctness here and if there are more than one ways what the merits and flaws are. >>> More
How do you solve this Haskell problem using higher order functions?

as seen on Stack Overflow - Search for 'Stack Overflow'
Using higher order functions (map, fold or filter) and if necessary lambda expressions. Write a definition for f1 and f2 so the following evaluation is valid: f1 (f2 (*) [1,2,3,4]) 5 output: [5,10,15,20] Any help would be appreciated, thanks. >>> More
Functional Methods on Collections

as seen on Programmers - Search for 'Programmers'
I'm learning Scala and am a little bewildered by all the methods (higher-order functions) available on the collections. Which ones produce more results than the original collection, which ones produce less, and which are most appropriate for a given problem? Though I'm studying Scala, I think this… >>> More
What's special about currying or partial application?

as seen on Programmers - Search for 'Programmers'
I've been reading articles on Functional programming everyday and been trying to apply some practices as much as possible. But I don't understand what is unique in currying or partial application. Take this Groovy code as an example: def mul = { a, b -> a * b } def tripler1 = mul.curry(3) def… >>> More
A more concise example that illustrates that type inference can be very costly?

as seen on Programmers - Search for 'Programmers'
It was brought to my attention that the cost of type inference in a functional language like OCaml can be very high. The claim is that there is a sequence of expressions such that for each expression the length of the corresponding type is exponential on the length of the expression. I devised the… >>> More