I've always stuck to the definition of a closed lambda term (the Y, U, S,
K, etc... combinators, for example). The colloquial usage generally implies
something like "a higher order function that does something interesting
(and possibly DSL-y)."
Kris
On Sat, Aug 24, 2013 at 12:09 AM, damodar kul
Thanks. I found the explanation given at the link quite useful in shedding
the confusion I had had.
Thanks and regards,
-Damodar Kulkarni
On Sat, Aug 24, 2013 at 10:57 AM, Jason Dagit wrote:
>
>
>
> On Fri, Aug 23, 2013 at 9:09 PM, damodar kulkarni
> wrote:
>
>> Hello,
>> The word "combinator
> Jason Dagit writes:
> Where can I find a formal and precise definition of the term
> "combinator",
A function that uses nothing but its arguments.
> as a term used by the Haskell community to describe "something"?
I find that Haskellers often use combinator to mean "a functio
On Fri, Aug 23, 2013 at 9:09 PM, damodar kulkarni wrote:
> Hello,
> The word "combinator" is used several times in the Haskell community. e.g.
> parser combinator, combinator library etc.
>
> Is it exactly the same term that is used in the "combinatory logic" ?
> A combinator is a higher-order fun
Hello,
The word "combinator" is used several times in the Haskell community. e.g.
parser combinator, combinator library etc.
Is it exactly the same term that is used in the "combinatory logic" ?
A combinator is a higher-order function that uses *only function
application* and earlier defined combi
