#### Overview of this book

Functional programming is a paradigm for developing software with better performance. It helps you write concise and testable code. To help you take your programming skills to the next level, this comprehensive book will assist you in harnessing the capabilities of functional programming with JavaScript and writing highly maintainable and testable web and server apps using functional JavaScript. This second edition is updated and improved to cover features such as transducers, lenses, prisms and various other concepts to help you write efficient programs. By focusing on functional programming, you’ll not only start to write but also to test pure functions, and reduce side effects. The book also specifically allows you to discover techniques for simplifying code and applying recursion for loopless coding. Gradually, you’ll understand how to achieve immutability, implement design patterns, and work with data types for your application, before going on to learn functional reactive programming to handle complex events in your app. Finally, the book will take you through the design patterns that are relevant to functional programming. By the end of this book, you’ll have developed your JavaScript skills and have gained knowledge of the essential functional programming techniques to program effectively.
Preface
Technical Requirements
Free Chapter
Becoming Functional - Several Questions
Thinking Functionally - A First Example
Starting Out with Functions - A Core Concept
Behaving Properly - Pure Functions
Programming Declaratively - A Better Style
Producing Functions - Higher-Order Functions
Transforming Functions - Currying and Partial Application
Connecting Functions - Pipelining and Composition
Designing Functions - Recursion
Ensuring Purity - Immutability
Implementing Design Patterns - The Functional Way
Building Better Containers - Functional Data Types
Bibliography
Other Books You May Enjoy

# Questions

6.1. A border case: What happens with our getField() function if we apply it to a null object? What should its behavior be? If necessary, modify the function.

6.2. How many? How many calls would be needed to calculate fib(50) without memoizing? For example, to calculate fib(0) or fib(1), one call is enough with no further recursion needed, and for fib(6), we saw that 25 calls were required. Can you find a formula to do this calculation?

6.3. A randomizing balancer: Write a higher-order function, that is, randomizer(fn1, fn2, ...), that will receive a variable number of functions as arguments and return a new function that will, on each call, randomly call one of fn1, fn2, and so on. You could possibly use this to balance calls to different services on a server if each function was able to do an Ajax call. For bonus points, ensure that no function will be called...