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

The Curry Howard isomorphism


The Curry Howard Isomorphism said that types are propositions and programs are their proofs. A proposition is an assertion (declarative statement), which is either true or false (but not both).

Examples of propositions

Consider the following examples of propositions:

  • The equation 2 * 3 = 5
  • If it is storming outside, then I take an Uber to class; otherwise, I walk, and if it is sunny, then I ride my bicycle:

Variable

Clause

a

It is storming outside

b

I take an Uber to class

c

I walk

d

It is sunny

e

I ride my bicycle

 

The following is the written logic version:

a implies b and ((not a) implies (c and (d implies e)))

The following is the logical symbols version:

(a ⇒ b) ∧ (¬a ⇒  (c ∧ (d⇒  e)))

Not propositions

The following are the examples of not propositions:

  • x = 5  (this is not an assertion of truth, it's an assignment)
  • x + y = 5 (not enough information to be an assertion, answer depends on missing data)

Propositions can combine terms using connectives (and, or not).

Lambda calculus

Alonzo...