How deeply does Functional Programming in Scala, Second Edition cover bind?

Explains the signature, operational meaning, and decomposition into map plus join, then stops at implementation exercises.

Bind

As explained in Functional Programming in Scala, Second Edition

Bind is a computation combinator that runs a computation and feeds its result to a function producing the next computation.

Bind runs an initial parallel computation, then uses its result to generate the next computation. The second computation need not exist until that result is available, so the operation is more general than choosing among preexisting containers or branches. section 7.4

From choice to flatMap

A conditional computation can be generalized from choice to chooser: pa.flatMap(f) runs pa, then applies f to its result to obtain the next Par computation. The next computation is therefore constructed from the first result rather than selected from a fixed collection. section 7.4

extension [A](pa: Par[A]) def flatMap[B](f: A => Par[B]): Par[B]

Inspect the flatMap signature that expresses bind for parallel computations. section 7.4

Related algebraic exercises include:

Use join to implement flatMap by mapping into a nested Par and flattening it. section 7.4
Use flatMap to implement join, then express map2 using flatMap and unit. section 7.4

How Functional Programming in Scala, Second Edition covers it

Cover of Functional Programming in Scala, Second Edition

liveBook manning.com

Read Functional Programming in Scala, Second Edition on liveBook Get the book at manning.com

Also explained in

liveBook manning.com

Fabulous Adventures in Data Structures and AlgorithmsBind is an operation that chains a context-producing function to a contextual value while flattening the resulting nested context.
liveBook manning.com

Learn Haskell by Examplebind is the Monad operation that applies a function to the value produced by a monadic computation and returns the resulting monadic computation.
liveBook manning.com

F# in Action: A Revised Edition of Get Programming with F#bind is a function that applies a computation producing an optional or effectful result and avoids nesting the result within the same computational context.
liveBook manning.com

Functional Design and Architecture: Examples in HaskellBind is the monadic operation that sequences a computation producing a contextual value with a function that consumes that value and produces the next contextual computation.

Compare how 5 books explain bind →

Related concepts

flatmapequivalent to · FlatMap is an operation that applies a function producing nested collections or computational contexts to each element and combines the resulting contexts into one flattened result.
do notationequivalent to · Do notation is Haskell syntax for sequencing monadic computations and binding their intermediate results in a readable, imperative-like form.
mapimplements · An operation that applies a function to values in a collection or computational context, producing corresponding results while preserving the collection or context’s structure.
fmapuses · Fmap is an operation that applies a function to values within a functor while preserving the functor’s structure.
monadused by · A monad is a functional abstraction that encapsulates computational context and provides operations for composing computations while preserving that context.
computation expressionused by · A computation expression is F# syntax and builder-based semantics for sequencing computations that carry an effect such as optionality, failure, or asynchrony.

This explainer was generated by Manning's knowledge graph from the text of Functional Programming in Scala, Second Edition. The section links point to the parts of the book it draws on.