Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Well (.) g f x = g (f x) in Haskell is just sugar for (.) g f = \x -> g (f x), which ultimately is turned into (.) = \g -> \f -> \x -> g (f x)


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: