Book Image

Learn Type-Driven Development

By : Yawar Amin, Kamon Ayeva
Book Image

Learn Type-Driven Development

By: Yawar Amin, Kamon Ayeva

Overview of this book

Type-driven development is an approach that uses a static type system to achieve results including safety and efficiency. Types are used to express relationships and other assumptions directly in the code, and these assumptions are enforced by the compiler before the code is run. Learn Type-Driven Development covers how to use these type systems to check the logical consistency of your code. This book begins with the basic idea behind type-driven development. You’ll learn about values (or terms) and how they contrast with types. As you progress through the chapters, you’ll cover how to combine types and values inside modules and build structured types out of simpler ones. You’ll then understand how to express choices or alternatives directly in the type system using variants, polymorphic variants, and generalized algebraic data types. You’ll also get to grips with sum types, build sophisticated data types from generics, and explore functions that express change in the types of values. In the concluding chapters, you’ll cover advanced techniques for code reuse, such as parametric polymorphism and subtyping. By end of this book, you will have learned how to iterate through a type-driven process of solving coding problems using static types, together with dynamic behavior, to obtain more safety and speed.
Table of Contents (12 chapters)

Generic code with functors

As we have seen, modules are important in OCaml and ReasonML, helping to organize code into units with specified interfaces. In addition to that, we are going to see now that they can serve for building generic code using what are called Functors.

What is a functor?

A functor is a function whose parameters are modules and whose result is a module.

Functors allow us to extend existing modules with new functionality, without requiring a lot of repetitive code for the different types we have.

The syntax of functors looks as follows:

module F = (M1: I1, ···): ResultI => {
...
};

With these characteristics, note the following:

  • The F functor has as parameters one or more M1 modules...