In this course, you'll study the fundamentals and principles of functional programming.

ocaml_utop_haskell.tar.gz

OCaml

Functional programming is a paradigm that builds complete applications by breaking down programs into constituent functions that empowers developers to build fast, bug-resistant applications.

You’ll be introduced to functional programming with illustrative examples contrasting the more widely used imperative programming paradigm. You’ll review lambda calculus as an introduction to expressions, the building blocks of functional programs. You’ll continue with abstractions and complex data types before exploring common computation patterns. Next, you’ll learn how dataflows create whole programs out of existing functions. Finally, you’ll finish by applying your functional programming knowledge to various real-world scenarios. At each step, you’ll learn OCaml and Haskell, while contrasting imperative programming with Java.

By the end of this course, you’ll be prepared to use functional programming in your daily work and have the framework to know when to use either imperative or functional paradigms.

Mastering Functional Programming with OCaml and Haskell

The `map` function is one of the most popular abstractions in the functional programming paradigm. It is best known for mapping the elements of a list to new elements. Due to its usefulness, `map` has found its way into most mainstream programming languages, such as JavaScript, Java, and Python. 

## The `map` function on lists
One way of looking at `map` on lists is that it represents a general method of computation on lists.
First, let's write a `square_list` function that squares all elements in a list to see what that pattern is.

The `map` function is one of the most popular abstractions in the functional programming paradigm. It is best known for mapping the elements of a list to new elements. Due to its usefulness, `map` has found its way into most mainstream programming languages, such as JavaScript, Java, and Python. 

# The `map` function on lists
One way of looking at `map` on lists is that it represents a general method of computation on lists.
First, let's write a `square_list` function that squares all elements in a list to see what that pattern is.

Understand the higher-order map function and see its applications on lists, trees, options, abstract domains, and contexts.

Introduction

Expressions: Building Blocks of Functional Programs

Building Abstractions with Functions

Compound Data Types

Common Computation Patterns

Dataflow Programming with Functions

Applying Functional Programming to Various Domains

Conclusion

Appendix

The map Function

The `map` function on lists