Book Image

Hands-On Functional Programming in Rust

By : Andrew Johnson
Book Image

Hands-On Functional Programming in Rust

By: Andrew Johnson

Overview of this book

Functional programming allows developers to divide programs into smaller, reusable components that ease the creation, testing, and maintenance of software as a whole. Combined with the power of Rust, you can develop robust and scalable applications that fulfill modern day software requirements. This book will help you discover all the Rust features that can be used to build software in a functional way. We begin with a brief comparison of the functional and object-oriented approach to different problems and patterns. We then quickly look at the patterns of control flow, data the abstractions of these unique to functional programming. The next part covers how to create functional apps in Rust; mutability and ownership, which are exclusive to Rust, are also discussed. Pure functions are examined next and you'll master closures, their various types, and currying. We also look at implementing concurrency through functional design principles and metaprogramming using macros. Finally, we look at best practices for debugging and optimization. By the end of the book, you will be familiar with the functional approach of programming and will be able to use these techniques on a daily basis.
Table of Contents (12 chapters)

Design Patterns

  1. What is a functor?

A functor defines data, accepts a function, and returns a transformation of the data.

  1. What is a contravariant functor?

A contravariant functor is a functor where the accepted function may produce 0, 1, or many return values. By comparison, functor's accepted functions must return exactly 1 value.

  1. What is a monad?

A monad, parameterized by a single type A, is a value that has a trait exposing two operations, usually named return and bind. return is a function that constructs a new monad<A> from a provided A value. bind should incorporate new information to produce a related but separate monad<B>.

  1. What are the monad laws?

These equivalencies must hold for strict monads. The three horizontal bars means equivalence:

_return(v).bind(f) ≡ f(v)

m.bind(_return) ≡ m

m.bind(f).bind(g) ≡ (|x| f(x).bind...