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

Build a 12-hour clock functor


We'll build a 12-hour clock functor like this one:

Structure

A clock with 12 places for the hours

Transformation operation

f(x) = x + 12, where x is the hour

First, let’s examine the functor implementation:

// src/functor/clock.go

package functor

import (
"fmt"
)

Define our ClockFunctor interface to include a single function (Map):

type ClockFunctor interface {
   Map(f func(int) int) ClockFunctor
}

Create a container to hold our list of 12 hours:

type hourContainer struct {
   hours []int
}

When called, Map will be executed/applied to each element in the container:

func (box hourContainer) Map(f func(int) int) ClockFunctor {
for i, el := range box.hours {
      box.hours[i] = f(el)
   }
return box
}

It's okay for the implementation of Map to be impure, as long as the side effects are limited to variables, such as the loop variables, scoped to the Map function. Notice that return the container, that we call box, whose elements have been transformed in some way by the mapper...