<div dir="ltr"><br><div class="gmail_extra"><br><br><div class="gmail_quote">On Fri, Aug 23, 2013 at 9:09 PM, damodar kulkarni <span dir="ltr"><<a href="mailto:kdamodar2000@gmail.com" target="_blank">kdamodar2000@gmail.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left-width:1px;border-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex"><div dir="ltr">Hello,<br>The word "combinator" is used several times in the Haskell community. e.g. parser combinator, combinator library etc.<br>
<br>Is it exactly the same term that is used in the "combinatory logic" ?<br>
<div style="margin-left:40px">A combinator is a higher-order function that uses *only function application* and earlier defined combinators to define a result from its arguments. [1]<br><br></div>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. <br>
<br>If the above observation holds, is the term combinator as used in the Haskell community, properly defined?<br><br>In other words:<br><br>Where can I find a formal and precise definition of the term "combinator", as a term used by the Haskell community to describe "something"?<br>
</div></blockquote><div><br></div><div>Good question. I believe this article addresses the points you raise: <a href="http://www.haskell.org/haskellwiki/Combinator">http://www.haskell.org/haskellwiki/Combinator</a></div></div>
</div></div>