\kˈɒmbɪnˌe͡ɪtə], \kˈɒmbɪnˌeɪtə], \k_ˈɒ_m_b_ɪ_n_ˌeɪ_t_ə]\
Definitions of COMBINATOR
Sort: Oldest first
A function with no free variables. A term iseither a constant, a variable or of the form A B denoting theapplication of term A (a function of one argument) to termB. Juxtaposition associates to the left in the absence ofparentheses. All combinators can be defined from two basiccombinators - S and K. These two and a third, I, are definedthus:S f g x= f x (g x)K x y= xI x= x= S K K xThere is a simple translation between combinatory logic andlambda-calculus. The size of equivalent expressions in thetwo languages are of the same order.Other combinators were added by David Turner in 1979 when heused combinators to implement SASL:B f g x = f (g x)C f g x = f x gS' c f g x = c (f x) (g x)B* c f g x = c (f (g x))C' c f g x = c (f x) gSee fixed point combinator, curried function,supercombinators.
By Denis Howe
Word of the day
- Complication diabetes from severe insulin deficiency coupled with an absolute or relative increase in concentration. metabolic acidosis is caused by breakdown of adipose stores and resulting increased levels free fatty acids. Glucagon accelerates the oxidation acids producing excess ketone bodies (ketosis).