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

The intuition here is that combinators are higher order functions which take functions and combine them together in various ways. So for a simple example "fix" is a combinator in regular maths where

Fix f = {f(x): f(x) = x for all x in the domain of f}

So if f is a function or a group action or whatever, the fixed-point set of f is all points x in the domain of f such that f(x)=x. ie the points which are unchanged by x. So if f is a reflection, the points which sit on the axis of reflection.

The fixed-point combinator is of particular relevance to this site because it's often called the y combinator.



No one who would ask that question would be able to understand your answer.


I’m going to frame this comment.


Hehe. Sorry. Yes perhaps you’re right. Wasn’t trying to be obtuse but I didn’t express that particularly clearly.


Perfectly clearly, just for a different audience.


Your explanation was several years worth of math studies beyond what GP was asking.




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

Search: