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 Swift Functional Programming
  • Table Of Contents Toc
  • Feedback & Rating feedback
Swift Functional Programming

Swift Functional Programming

By : Nayebi
4.3 (3)
close
close
Swift Functional Programming

Swift Functional Programming

4.3 (3)
By: Nayebi

Overview of this book

Swift is a multi-paradigm programming language enabling you to tackle different problems in various ways. Understanding each paradigm and knowing when and how to utilize and combine them can lead to a better code base. Functional programming (FP) is an important paradigm that empowers us with declarative development and makes applications more suitable for testing, as well as performant and elegant. This book aims to simplify the FP paradigms, making them easily understandable and usable, by showing you how to solve many of your day-to-day development problems using Swift FP. It starts with the basics of FP, and you will go through all the core concepts of Swift and the building blocks of FP. You will also go through important aspects, such as function composition and currying, custom operator definition, monads, functors, applicative functors,memoization, lenses, algebraic data types, type erasure, functional data structures, functional reactive programming (FRP), and protocol-oriented programming(POP). You will then learn to combine those techniques to develop a fully functional iOS application from scratch
Table of Contents (12 chapters)
close
close

Monoids


In mathematics, Monoids can be considered as categories with a single object. They capture the idea of function composition within a set. In fact, all functions from a set into itself naturally form a Monoid with respect to function composition.

In computer science, there are different types of Monoid, such as free, transition, syntactic, trace, and history. A set of strings built from a given set of characters is a free Monoid. The transition Monoid and syntactic Monoid are used to describe finite state machines, whereas trace Monoids and history Monoids provide a foundation for process calculi and concurrent computing.

Simply put, in computer science, a Monoid is a set, a binary operation, and an element of the set with the following rules:

  • Associativity of binary operations
  • The element is the identity

Simply put, a structure is a Monoid if the structure is a Semigroup with an element that is the identity. So let's define a new protocol that extends our Semigroupprotocol:

protocol Monoid...

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech

Create a Note

Modal Close icon
You need to login to use this feature.
notes
bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete

Delete Note

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete

Edit Note

Modal Close icon
Write a note (max 255 characters)
Cancel
Update Note

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