Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Learning Functional Programming in Go
  • Table Of Contents Toc
Learning Functional Programming in Go

Learning Functional Programming in Go

By : Lex Sheehan
4.1 (8)
close
close
Learning Functional Programming in Go

Learning Functional Programming in Go

4.1 (8)
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 (13 chapters)
close
close

The Lambda Calculus


Lambda calculus is a logical system of rules for expressing computation using variable binding, abstraction, and function application. We can define anonymous functions and apply those functions. Lambda calculus would be limited if it weren't for recursion. Pure functional programming languages derived from lambda calculus include LISP, Haskell, and ML.

Lambda Expressions

A lambda expression is an instance of a functional interface consisting of a set of terms. These terms can be variables like x, y, and z. These are not mutating variables, but rather placeholders for values or other lambda terms. The variable inside of x is applied to whatever it is bound to. The variable x is inside the term t. The lambda abstraction is defined as λ x.t.

For example, if we have the equation f(x) = x2 and replace x with 5, we have f(5) =  52.

When the function f is applied to x, we get x2. In our example, the function f is applied to the argument 5 and we get 52.

We can eliminate the parentheses...

CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Learning Functional Programming in Go
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon