Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Advanced Search Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Functional Python Programming
  • Toc
  • feedback
Functional Python Programming

Functional Python Programming

By : Steven F. Lott
4 (9)
close
Functional Python Programming

Functional Python Programming

4 (9)
By: Steven F. Lott

Overview of this book

This book is for developers who want to use Python to write programs that lean heavily on functional programming design patterns. You should be comfortable with Python programming, but no knowledge of functional programming paradigms is needed.
Table of Contents (18 chapters)
close
close
Preface
Preface
What this book covers
What you need for this book
Who this book is for
Conventions
Reader feedback
Customer support
Free Chapter
1
1. Introducing Functional Programming
1. Introducing Functional Programming
Identifying a paradigm
Subdividing the procedural paradigm
A classic example of functional programming
Exploratory Data Analysis
Summary
2
2. Introducing Some Functional Features
2. Introducing Some Functional Features
First-class functions
Immutable data
Strict and non-strict evaluation
Recursion instead of a explicit loop state
Functional type systems
Familiar territory
Saving some advanced concepts
Summary
3
3. Functions, Iterators, and Generators
3. Functions, Iterators, and Generators
Writing pure functions
Functions as first-class objects
Using strings
Using tuples and namedtuples
Cleaning raw data with generator functions
Using lists, dicts, and sets
Summary
4
4. Working with Collections
4. Working with Collections
An overview of function varieties
Working with iterables
Using zip() to structure and flatten sequences
Using reversed() to change the order
Using enumerate() to include a sequence number
Summary
5
5. Higher-order Functions
5. Higher-order Functions
Using max() and min() to find extrema
Using Python lambda forms
Lambdas and the lambda calculus
Using the map() function to apply a function to a collection
Using map() with multiple sequences
Using the filter() function to pass or reject data
Using filter() to identify outliers
The iter() function with a sentinel value
Using sorted() to put data in order
Writing higher-order functions
Writing higher-order mappings and filters
Writing generator functions
Building higher-order functions with Callables
Looking at some of the design patterns
Summary
6
6. Recursions and Reductions
chevron up
6. Recursions and Reductions
Simple numerical recursions
Group-by reductions – from many to fewer
Summary
7
7. Additional Tuple Techniques
7. Additional Tuple Techniques
Using an immutable namedtuple as a record
Building namedtuples with functional constructors
Avoiding stateful classes by using families of tuples
Polymorphism and Pythonic pattern matching
Summary
8
8. The Itertools Module
8. The Itertools Module
Working with the infinite iterators
Using the finite iterators
Cloning iterators with tee()
The itertools recipes
Summary
9
9. More Itertools Techniques
9. More Itertools Techniques
Enumerating the Cartesian product
Reducing a product
Permuting a collection of values
Generating all combinations
Recipes
Summary
10
10. The Functools Module
10. The Functools Module
Function tools
Memoizing previous results with lru_cache
Defining classes with total ordering
Applying partial arguments with partial()
Reducing sets of data with reduce()
Summary
11
11. Decorator Design Techniques
11. Decorator Design Techniques
Decorators as higher-order functions
Cross-cutting concerns
Composite design
Adding a parameter to a decorator
Implementing more complex descriptors
Recognizing design limitations
Summary
12
12. The Multiprocessing and Threading Modules
12. The Multiprocessing and Threading Modules
What concurrency really means
The boundary conditions
Sharing resources with process or threads
Where benefits will accrue
Using multiprocessing pools and tasks
Using a multiprocessing pool for concurrent processing
Summary
13
13. Conditional Expressions and the Operator Module
13. Conditional Expressions and the Operator Module
Evaluating conditional expressions
Using the operator module instead of lambdas
Starmapping with operators
Reducing with operators
Summary
14
14. The PyMonad Library
14. The PyMonad Library
Downloading and installing
Functional composition and currying
Functional composition and the PyMonad multiplication operator
Functors and applicative functors
Monad concepts, the bind() function and the Binary Right Shift operator
Implementing simulation with monads
Additional PyMonad features
Summary
15
15. A Functional Approach to Web Services
15. A Functional Approach to Web Services
The HTTP request-response model
The WSGI standard
Defining web services as functions
Tracking usage
Summary
16
16. Optimizations and Improvements
16. Optimizations and Improvements
Memoization and caching
Specializing memoization
Optimizing storage
Optimizing accuracy
Case study – making a chi-squared decision
Computing expected values and displaying a contingency table
Summary
17
Index
Index

Simple numerical recursions

We can consider all numeric operations to be defined by recursions. For more depth, read about the Peano axioms that define the essential features of numbers. http://en.wikipedia.org/wiki/Peano_axioms is one place to start.

From these axioms, we can see that addition is defined recursively using more primitive notions of the next number, or successor of a number, n, Simple numerical recursions.

To simplify the presentation, we'll assume that we can define a predecessor function,Simple numerical recursions, such that Simple numerical recursions, as long as Simple numerical recursions

Addition between two natural numbers could be defined recursively as follows:

Simple numerical recursions

If we use more common Simple numerical recursions and Simple numerical recursions instead of Simple numerical recursions and Simple numerical recursions, we can see that Simple numerical recursions.

This translates neatly in Python, as shown in the following command snippet:

def add(a,b):
    if a == 0: return b
    else: return add(a-1, b+1)

We've simply rearranged common mathematical notation into Python. The if clauses are placed to the left instead of the right.

Generally, we don't provide our own functions in Python to do simple...

End of Section 2
Next Section
bookmark search playlist 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