Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletter Hub
Free Learning
Arrow right icon
timer SALE ENDS IN
0 Days
:
00 Hours
:
00 Minutes
:
00 Seconds
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
 Sheehan Sheehan
Author Profile Icon Sheehan
Sheehan
Arrow right icon
View More author details
Toc

Table of Contents (21) Chapters Close

Title Page
Credits
About the Author
Acknowledgments
About the Reviewer
www.PacktPub.com
Customer Feedback
Preface
1. Pure Functional Programming in Go FREE CHAPTER 2. Manipulating Collections 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 Index

Historical Events in Functional Programming


The history of functional programming is nothing short of fascinating. Functional programming languages are based on an elegant yet simple mathematical foundation, Lambda calculus.

"To understand a science, it is necessary to know its history."                                                                                               - Auguste Comte

Let's look at the discoveries that led up to Lambda calculus.

George Boole (1815 - 1864)

Logic came from ancient Greeks such as Aristotle and Euclid. Prior to Boole, logic was literally in Greek; it was expressed in the form of language. Boole was the first to translate logic into algebraic symbols:

  • true = 1
  • false = 0
  • and = product (AxB)
  • or = sum(A+B)

Augustus De Morgan (1806 - 1871)

De Morgan's Law stated that all logical operations can be expressed in terms of and, or, and not. Furthermore, all logical operations can also be expressed in terms of just and and not, or just or and not:

a ∧ b = ¬ ( (¬ a) ∨ ...

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 £13.99/month. Cancel anytime
Visually different images