24 Aug 06:09 2013

## definition of the term "combinator"

damodar kulkarni <kdamodar2000 <at> gmail.com>

2013-08-24 04:09:52 GMT

2013-08-24 04:09:52 GMT

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" ?

If the above observation holds, is the term combinator as used in the Haskell community, properly defined?

In other words:

Where can I find a formal and precise definition of the term "combinator", as a term used by the Haskell community to describe "something"?

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 combinators to define a result from its arguments. [1]

It seems, the term combinator as in, say, "parser combinator", doesn't have much to do with the "*only function application*" requirement of the "combinatory logic", per se. If the above observation holds, is the term combinator as used in the Haskell community, properly defined?

In other words:

Where can I find a formal and precise definition of the term "combinator", as a term used by the Haskell community to describe "something"?

Thanks and regards,

-Damodar Kulkarni

-Damodar Kulkarni

_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe <at> haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe