Gain insights into functional programming with OCaml and Haskell, explore lambda calculus, abstractions, and dataflows, and learn to apply these concepts to real-world scenarios, contrasting with Java.

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

## Dataflow programming paradigm

[Dataflow programming](https://en.wikipedia.org/wiki/Dataflow_programming) is a programming paradigm in which we model programs as directed graphs consisting of nodes and directed edges connecting the nodes. A node represents an operation that accepts inputs and produces output. A directed edge from node A to node B sends A's output as B's input.
To illustrate, let’s use an example of arithmetic calculation from Bert Sutherland’s Ph.D. thesis titled “_The on-line graphical specification of computer procedures_,” which pioneered dataflow programming.


# Dataflow programming paradigm

[Dataflow programming](https://en.wikipedia.org/wiki/Dataflow_programming) is a programming paradigm in which we model programs as directed graphs consisting of nodes and directed edges connecting the nodes. A node represents an operation that accepts inputs and produces output. A directed edge from node A to node B sends A's output as B's input.
To illustrate, let’s use an example of arithmetic calculation from Bert Sutherland’s Ph.D. thesis titled “_The on-line graphical specification of computer procedures_,” which pioneered dataflow programming.


Learn how functional programming allows us to construct programs in the dataflow style by connecting functions.

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

List-based Dataflow Programming

Dataflow programming paradigm