Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’ve been using Scheme and Common Lisp for a while and there is one thing about nomenclature that I never got:
I know that combinators are procedures with no free variables, but I seldom see them being called “combinators”, except for those that deal with lists and other sequences.
Is my perception correct? Or is there some other definition of “combination” that I’m missing?
If you have any function that deals with lists, then it’s no longer a real combinator, since it needs to use list functions. A “real” combinator is one that really uses no free identifiers, not even
consetc. (But the term can sometime be used more loosely.)