Functional Programming

4.

Type Systems in Functional Programming

4.1.

The Role of Types

4.1.1.

4.1.2.

4.1.3.

Documentation Through Types

4.1.4.

Compiler Optimizations

4.2.

Static vs. Dynamic Typing

4.2.1.

Advantages and Trade-offs

4.2.2.

Examples in Functional Languages

4.2.3.

Type Checking at Compile Time vs. Runtime

4.3.

Strong vs. Weak Typing

4.3.1.

Type Enforcement

4.3.2.

4.3.3.

Type Safety Guarantees

4.4.

4.4.1.

Definition and Mechanism

4.4.2.

Benefits and Limitations

4.4.3.

Hindley-Milner Type System

4.4.4.

Local vs. Global Type Inference

4.5.

Algebraic Data Types

4.5.1.

4.5.1.1.

4.5.1.2.

4.5.1.3.

4.5.2.

4.5.2.1.

4.5.2.2.

4.5.2.3.

4.5.3.

Recursive Types

4.5.3.1.

4.5.3.2.

4.5.3.3.

Mutually Recursive Types

4.5.4.

4.5.5.

Generalized Algebraic Data Types

4.6.

Pattern Matching

4.6.1.

Deconstructing Data Types

4.6.2.

Matching on Product Types

4.6.3.

Matching on Sum Types

4.6.4.

Exhaustiveness Checking

4.6.5.

Guards and Conditional Patterns

4.6.6.

Nested Patterns

4.6.7.

Pattern Matching vs. Conditionals

4.7.

4.7.1.

Parametric Polymorphism

4.7.1.1.

4.7.1.2.

4.7.1.3.

4.7.2.

Ad-hoc Polymorphism

4.7.2.1.

4.7.2.2.

4.7.2.3.

4.7.3.

Subtype Polymorphism

4.8.

Type Classes and Traits

4.8.1.

Definition and Usage

4.8.2.

Common Type Classes

4.8.2.1.

4.8.2.2.

4.8.2.3.

4.8.2.4.

4.8.2.5.

4.8.2.6.

4.8.3.

Implementing Type Classes

4.8.4.

Type Class Hierarchies

4.8.5.

Coherence and Orphan Instances

Previous

3. Core Techniques and Patterns

Go to top

Next

5. Advanced Functional Abstractions