0% completed

All LessonsFree Lessons (4)

Introduction

A First Look at Haskell Why You Should Learn Haskell

First Steps with Haskell

Numeric Types Predefined Functions on Numbers Booleans Characters Strings Writing Functions Pattern Matching on Literals Guarded Function Equations Tuples Functions with Multiple Arguments Currying Currying and Uncurrying

Techniques for Writing Functions

Recursion Termination Lazy Evaluation Writing Recursive Functions Multiple Recursive Calls Writing Higher-Order Functions Lambda Expressions Functions and Operators Operator Association and Precedence Syntactic Sugar I: if and case Syntactic Sugar II: let and where

Working with Lists

Introduction to Lists Common Functions on Lists Polymorphic types Recursive Functions on Lists Higher-Order Functions on Lists I: Map and Filter Higher-Order Functions on Lists II: Folds Laziness in Lists List Comprehension

Creating Data Types

Defining Types with data

Nesting Custom Types

Introduction to Type Classes

Important Type Classes

Type Synonyms and newtype Wrappers

Creating Polymorphic Types

Creating Recursive Types

Input and Output

IO By Example More IO Functions Do Notation Larger Example: Solving Mazes

Conclusion

Recap and Outlook

Appendix

Setting up Haskell

Learn Functional Programming in Haskell/

...

/

Introduction to Type Classes

Introduction to Type Classes

Get introduced to the concept of type classes.

We'll cover the following...

- Type class constraints

In the previous lesson, we defined our own data type for geometric shapes. In order to make them printable, we had to add deriving (Show) to our type declaration.

Show is an example of a Haskell type class. We also encountered the type class Eq, already, in type annotations of polymorphic functions (e.g. elem), where it acted as a constraint. In this lesson, we will learn in more detail what type classes are and how we can use ...