Need some help with (S)ML

[hellfreeze]

I'm currently taking a functional programming language course at college and can't wrap my head around how to solve the problem. I was wondering if someone can help point me in the right direction with pseudo-code or something.

Description: Using the built-in 'map' function in ML, the function is accepting a list of curried functions and needs to return a list with each function applied to X. The function needs to be a one line definition.

Here is what I have been working with, but can't seem to get it working properly:

fun funApply funList x =
	map (fn n => (hd funList) x) funList;

val funApply = fn : ('a -> 'b) list -> 'a -> 'b list

I know this is not correct as it will only apply the first curried function in the list to x:

- funApply [(fn z => z*z),(fn z => z),(fn z => z*z*z)] 5;
val it = [25,25,25] : int list

I need to do recursion on funList, but can't figure out how to go about doing it. Can someone please shed some light on how to go about doing this?

 

[hellfreeze]

I managed to figure this out, and I must say, my brain must have been seriously fried. Here is the answer should anyone ever search for something similar and need help:

fun funApply funList x = map ((fn (f) => f(x))) funList;

 

[Jodell88]

I remember doing SML and Prolog in class. Both of them were hard for me to wrap my head around, especially Prolog.

 

[hellfreeze]

I remember doing SML and Prolog in class. Both of them were hard for me to wrap my head around, especially Prolog.

I agree, it is a bit confusing. I wonder if this will actually be beneficial later down the road or what the point of learning this stuff is. I can see how Assembly is important in understanding how C++ or another language is translated, but this one I don't get. Maybe these languages become more relevant in the creation of a compiler?