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

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/

...

/

Termination

Termination

Learn about the termination of programs.

We'll cover the following...

- Non-termination
- Example: compoundInterest

Once we start writing recursive functions, we need to worry about the termination of our programs (i.e. do they return a result in a finite amount of time?

Non-termination

It is possible to write recursive functions that do not ...