Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Learning Functional Programming in Go

You're reading from   Learning Functional Programming in Go Change the way you approach your applications using functional programming in Go

Arrow left icon
Product type Paperback
Published in Nov 2017
Publisher Packt
ISBN-13 9781787281394
Length 670 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Lex Sheehan Lex Sheehan
Author Profile Icon Lex Sheehan
Lex Sheehan
Arrow right icon
View More author details
Toc

Table of Contents (13) Chapters Close

Preface 1. Pure Functional Programming in Go 2. Manipulating Collections FREE CHAPTER 3. Using High-Order Functions 4. SOLID Design in Go 5. Adding Functionality with Decoration 6. Applying FP at the Architectural Level 7. Functional Parameters 8. Increasing Performance Using Pipelining 9. Functors, Monoids, and Generics 10. Monads, Type Classes, and Generics 11. Category Theory That Applies 12. Miscellaneous Information and How-Tos

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...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image