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

# Challenge 1: Prime number

Write an OCaml function, `is_prime: integer -> bool`, that returns `true` if the input number is a prime number and `false` otherwise.

(** [is_prime x] is [true] if [x] is a prime and [false] otherwise. *)
let is_prime x = false (* TODO: Replace the hard-coded value with your code here *)

let rec is_prime n =
    if n < 2 then false else if n = 2 then true else
        let rec aux m = if n mod m = 0 then false
                        else if m * m > n then true else aux (m + 1) in aux 2

# Challenge 2: Naive Fibonacci
The [Fibonacci series](https://en.wikipedia.org/wiki/Fibonacci_number) looks like this: `1 1 2 3 5 8 13 ...`

Formally,

```haskell
Fibonacci 0 = 0
Fibonacci 1 = 1
Fibonacci 2 = 1
Fibonacci n = Fibonacci (n-1) + Fibonacci (n-2) for n > 2
```

Write an OCaml function, `fib: int -> int`, that returns the `n-th` Fibonacci number where $n \geq 0$. 


Let's solve some coding challenges to practice building function abstractions.

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

Programming Challenges

Challenge 1: Prime number

Challenge 2: Naive Fibonacci