What is the name of x.f.fx in lambda calculus?Does the corresponding function have a standard name in functional programming languages, like Haskell?In object oriented programming, is there a usual name for a method foo which takes a function as an argument, such that x.foo(f) returns f(x)?
What is the name of x.f.fx (like reverse apply) in lambda calculus? Does the corresponding function have a standard name in programming?
functional programming;haskell;lambda
In the original Alonzo Church's The calculi of lambda-conversion, he denotes this combinator by T.In the context of Church numerals, it is called exp.This matches the shorthand notation used by Church for the application of a term N to a term M: [MN] stands for (NM).I haven't heard yet of a standard name for an analogous function in programming.