Function Composition - forward composition versus backward composition
0 likes737 views
The document discusses function composition in Scala. It defines forward composition as applying one function f to the result of another function g, written as f andThen g. Backward composition applies functions in the opposite order, first applying g and then f to the result, written as f compose g. Both operations can be implemented as curried functions in Scala, with andThen and compose respectively, that take the functions as arguments and return a function combining their operations.
1 of 1
Downloaded 13 times
(g: Y => Z): X => Z = { x => g(f(x)) }
The type signature of this curried function is
This type signature requires the types of the function arguments to match in a certain way, or else the composition is undefined.
The backward composition of two functions f and g works in the opposite order: first g is applied and
then f is applied to the result. Using the symbol (pronounced “after”) for this operation, we can write
In Scala, the backward composition is called compose and used as f compose g. This method may be
Implemented as a fully parametric function
def compose[X, Y, Z](f: Y => X)(g: Z => Y): Z => X = { z => f(g(z)) }
The type signature of this curried function is Sergei Winitzki
sergei-winitzki-11a6431](https://image.slidesharecdn.com/function-composition-forward-and-backword-190810180401/85/Function-Composition-forward-composition-versus-backward-composition-1-320.jpg)
More Related Content
What's hot (20)
Similar to Function Composition - forward composition versus backward composition (20)
PDF
List-based Monadic Computations for Dynamically Typed Languages (Python version)Wim VanderbauwhedeAd
More from Philip Schwarz (20)
Ad
Recently uploaded (20)
Function Composition - forward composition versus backward composition
- 1. That new function is called the forward composition of the two functions f and g. In Scala, this operation is written as f andThen g … … The forward composition is denoted by (pronounced “before”) and can be defined as The symbol , means “is defined as”. We could write the forward composition as a fully parametric function, def andThen[X, Y, Z](f: X => Y)(g: Y => Z): X => Z = { x => g(f(x)) } The type signature of this curried function is This type signature requires the types of the function arguments to match in a certain way, or else the composition is undefined. The backward composition of two functions f and g works in the opposite order: first g is applied and then f is applied to the result. Using the symbol (pronounced “after”) for this operation, we can write In Scala, the backward composition is called compose and used as f compose g. This method may be Implemented as a fully parametric function def compose[X, Y, Z](f: Y => X)(g: Z => Y): Z => X = { z => f(g(z)) } The type signature of this curried function is Sergei Winitzki sergei-winitzki-11a6431