Gain insights into Elixir's functional programming fundamentals, explore expressions, modules, conditional statements, recursion, and delve into advanced topics like higher-order functions and application design. Discover Elixir's vibrant community and tooling.

Learn Functional Programming with Elixir by The Pragmatic Programmer_468 x 60 copy.png

elixir.tar.gz

Elixir

Elixir-SPA

Elixir-SPA-cleared

Elixir script

Elixir-SPA-script

Elixir-SPA-copy all

Elixir-SPA-copy all-dungeon

Elixir-test

Elixir-SPA-test

Elixir is a functional programming language that runs in the Erlang VM, a powerful environment to run distributed systems. This course uses Elixir because of its fun syntax, vibrant community, and production-ready tooling. Elixir syntax lets you focus on what’s important while learning functional programming.

Starting from scratch, you will learn the fundamentals of Elixir including expressions, modules, conditional statements, and recursion. Towards the end of the course, you will focus on more advanced material like higher-order functions, how to handle impure functions, and lastly how to design an application using Elixir and functional programming principles.

By the end, you will be able to write basic Elixir programs that follow the functional programming paradigm.

Learn Functional Programming with Elixir

```Elixir
defmodule Sum do
   def up_to(0), do: 0
   def up_to(n), do: n + up_to(n - 1)
end

iex> Sum.up_to(6)
```
How many function calls to the `up_to` function are made here?

<pre><code class="language-Elixir">defmodule Sum do
 def up_to(0), do: 0
 def up_to(n), do: n + up_to(n - 1)
end

iex&gt; Sum.up_to(6)
</code></pre>
How many function calls to the <code>up_to</code> function are made here?

In bounded recursion, a stop condition is set.

The number of repetitions of a bounded recursive function is directly associated with the arguments that it receives.

In bounded recursion, the successive calls to itself have an end. 

Which statement about bounded recursion is incorrect?

Which statement about bounded recursion is incorrect?

It is a technique for reducing a problem to its simplest form and starting to solve it incrementally.

We conquer the problem progressively from its simplest form.

The *merge sort* algorithm is an example of it.

Which statement about *decrease and conquer* is incorrect?

Which statement about decrease and conquer is incorrect?

The compiler reduces functions in memory without allocating more memory.

The compiler optimizes the functions running time by putting other processes on hold.

The compiler reduces functions in memory while allocating more memory.

The compiler optimizes the functions running time by running it only when a few processes are running.

Which statement about tail-call optimization is correct?

Which statement about tail-call optimization is correct?

It can predict the number of repetitions the function will make.

It can’t predict the number of repetitions for a recursive function.

Stop conditions or depth restrictions need to be added to unbounded recursive functions.

Without a boundary condition, unbounded recursive functions would run infinitely.

Which statement about unbounded recursion is incorrect?

Which statement about unbounded recursion is incorrect?

Getting Started

Introduction to Functional Programming

Working with Variables and Functions

Using Pattern Matching to Control Program Flow

Diving into Recursion

Using Higher-Order Functions

Designing Your Elixir Applications

Handling Impure Functions

Conclusion

Appendices

Quiz