Book Image

Mastering JavaScript Functional Programming

By : Federico Kereki
Book Image

Mastering JavaScript Functional Programming

By: Federico Kereki

Overview of this book

Functional programming is a programming paradigm for developing software using functions. Learning to use functional programming is a good way to write more concise code, with greater concurrency and performance. The JavaScript language is particularly suited to functional programming. This book provides comprehensive coverage of the major topics in functional programming with JavaScript to produce shorter, clearer, and testable programs. You’ll delve into functional programming; including writing and testing pure functions, reducing side-effects, and other features to make your applications functional in nature. Specifically, we’ll explore techniques to simplify coding, apply recursion for loopless coding, learn ways to achieve immutability, implement design patterns, and work with data types. By the end of this book, you’ll have developed the JavaScript skills you need to program functional applications with confidence.
Table of Contents (22 chapters)
Title Page
About the Author
About the Reviewer
Customer Feedback
Connecting Functions - Pipelining and Composition
Answers to Questions


12.1. Maybe tasks? In the questions section of Chapter 8, Connecting Functions - Pipelining and Composition, a question had to do with getting the pending tasks for a person, but taking into account errors or border situations, such as the possibility that the selected person might not even exist. Redo that exercise, but using Maybe or Either monads to simplify that coding.

12.2. Extending your trees. In order to get a more complete implementation of our functional binary search trees, implement the following functions:

  • Calculate the tree's height -- or, equivalently, the maximum distance from the root to any other node
  • List all the tree's keys, in ascending order
  • Delete a key from a tree

12.3. Functional lists. In the same spirit of the binary trees, implement functional lists. Since a list is defined to be either empty or a node (head) followed by another list (tail), you might want to start with the following:

     const List = (head, tail) => (destructure, __) =>