Book Image

Learning Functional Programming in Go

By : Lex Sheehan
Book Image

Learning Functional Programming in Go

By: Lex Sheehan

Overview of this book

Lex Sheehan begins slowly, using easy-to-understand illustrations and working Go code to teach core functional programming (FP) principles such as referential transparency, laziness, recursion, currying, and chaining continuations. This book is a tutorial for programmers looking to learn FP and apply it to write better code. Lex guides readers from basic techniques to advanced topics in a logical, concise, and clear progression. The book is divided into four modules. The first module explains the functional style of programming: pure functional programming, manipulating collections, and using higher-order functions. In the second module, you will learn design patterns that you can use to build FP-style applications. In the next module, you will learn FP techniques that you can use to improve your API signatures, increase performance, and build better cloud-native applications. The last module covers Category Theory, Functors, Monoids, Monads, Type classes and Generics. By the end of the book, you will be adept at building applications the FP way.
Table of Contents (21 chapters)
Title Page
Credits
About the Author
Acknowledgments
About the Reviewer
www.PacktPub.com
Customer Feedback
Preface
Index

Composable concurrency


Functional programming is not only about composing functions and algebraic data structures--it makes concurrency composable--something that's virtually impossible with other programming paradigms.

How can we take what we've learned about morphisms and apply it to creating highly concurrent processing models? Suppose we start with a monolithic application with a single binary executable.

What if we can focus only on the morphisms, that is, the interface of inputs and outputs, in our system?

Consider that we're given the following:

  • Inputs and outputs can be mapped through isomorphisms
  • The state exists in the groupings of our objects
  • Morphisms are stateless

Finite state machines

Can we assume that the finite state machines (FSMs) of our system exist within our groupings? (Where the FSM would be like the A and B groupings that we looked at previously.)

Let's imagine systematically decomposing our FSMs into the smallest possible components.

Starting with our context component C,...