Re: Type checking

Hi,

Can anyone explain to me how hugs manages to derive that

f x y z = y (y z) x

is of type

f :: a -> ((a -> b) -> a -> b) -> (a -> b) -> b

This question was posted from an Oxford University computer; it also smells like homework. If it's genuinely not homework, Lee, I apologise! See http://www.haskell.org/hawiki/HomeworkHelp --KW 8-) -- Keith Wansbrough <kw217@cl.cam.ac.uk> http://www.cl.cam.ac.uk/users/kw217/ University of Cambridge Computer Laboratory.