In the Functional Program Design in Scala course by Coursera, you will learn how to apply the functional programming style in the design of larger Scala applications. You’ll get to know important new functional programming concepts, from lazy evaluation to structuring your libraries using monads. We’ll work on larger and more involved examples, from state space exploration to random testing to discrete circuit simulators.
You’ll also learn some best practices on how to write good Scala code in the real world. Finally, you will learn how to leverage the ability of the compiler to infer values from types.
Several parts of this course deal with the question of how functional programming interacts with mutable states. We will explore the consequences of combining functions and states. We will also look at purely functional alternatives to mutable states, using infinite data structures or functional reactive programming.
By the end of this course you will be able to:
- recognize and apply design principles of functional programs,
- design functional libraries and their APIs,
- competently combine functions and state in one program,
- understand reasoning techniques for programs that combine functions and state,
- write simple functional reactive applications.
Several parts of this course deal with the question of how functional programming interacts with mutable states. We will explore the consequences of combining functions and state. We will also look at purely functional alternatives to mutable states, using infinite data structures or functional reactive programming.
WEEK 1 – For Expressions and Monads
We’ll start by revisiting some concepts that we have learned from Principles of Functional Programming in Scala; collections, pattern matching, and functions. We’ll then touch on for-comprehensions, a powerful way in Scala to traverse a list, process it, and return a new list. We’ll see how to do queries with for-comprehensions as well as how the for-comprehension is “desugared” into calls to higher-order functions by the Scala compiler. Finally, we’ll discuss what monads are, and how to verify that the monad laws are satisfied for a number of examples.
WEEK 2 – Lazy Evaluation
This week we’ll revisit performance issues caused by combinatorial search, and we’ll discover an important concept in functional programming that can these issues: laziness. We’ll also learn a little bit about proofs on trees; in particular, we’ll see how to extend structural induction to trees.
WEEK 3 – Type-Directed Programming
This week, we’ll learn how to make the compiler write programs for us! We’ll see how the compiler can summon program fragments based on their type and how this mechanism can be used to implement a new form of polymorphism (type classes).
WEEK 4 – Functions and State
This week, we’ll learn about state and side effects. Through a rich example, we’ll learn programming patterns for managing state in larger programs. We’ll also learn about for-loops and while-loops in Scala.
WEEK 5 – Timely Effects
This week we’ll learn a number of important programming patterns via examples, starting with the observer pattern, and then going on to functional reactive programming.
- Martin Odersky
- Erik Meijer
- Roland Kuhn