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

Summary


In this chapter, we learned how to use tooling to solve issues that arise in Go because of its lack of support for generics. We were able to use this tooling to generate underscore like features in our Go code by starting with properly defined base types. With no more worries about potential generics support slowing down our runtime executables (as is the case with Java), we jumped for joy with an unexpected productivity boost.

We continued forward into the land of pure FP, where we tackled the concept of function composition. With g.f(x) == g(f(x)) in our tool belt, we studied functors and learned how to transform lists of items. We chained our maps and even learned how attorneys can use the forgetful functor to win cases in court for their clients.

We wrapped up the chapter with monoids. We not only learned the algebraic laws of monoids, but we implemented them. We chained Append methods and even wrote a couple of reductions.

In the next chapter, we'll continue our on our path towards...