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

Homomorphism


Here's a Venn diagram depicting how the different categories of homomorphisms relate to one another:

Abbreviation

Description

Mono

Set of monomorphisms (injective)

Epi

Set of epimorphism (surjective)

Iso

Set of isomorphisms (bijective)

Auto

Set of automorphisms (bijective and endomorphic)

 

A homomorphism is a correspondence between set A (the domain) and set B (the codomain or range), so that each object in A determines a unique object in B and each object in B has an arrow/function/morphism pointing to it from A.

If operations, for example, addition and multiplication, are defined for A and B, it is required that they correspond. That is, a * b must correspond to f(a) * f(b).

Homomorphisms preserve correspondence

Correspondence must be as follows:

  • Single-valued: The morphism must at least be a partial function
  • Surjective: Each a in A has at least one f(a) in B

Homomorphism is a way to compare two groups for structural similarities. It's a function between two groups that preserve their structure...

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