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?
Manoj Govindan
75.2k21 gold badges138 silver badges142 bronze badges
asked Sep 17, 2010 at 14:05
josh
1,0271 gold badge8 silver badges13 bronze badges
1 Answer 1
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 cons etc. (But the term can sometime be used more loosely.)
answered Sep 17, 2010 at 14:30
Eli Barzilay
29.6k3 gold badges69 silver badges115 bronze badges
Sign up to request clarification or add additional context in comments.
Comments
Explore related questions
See similar questions with these tags.
lang-lisp