Till KTH:s startsida Till KTH:s startsida

Visa version

Version skapad av Johan Montelius 2017-11-08 12:38

Visa < föregående | nästa >
Jämför < föregående | nästa >

Lists, trees and recursion

In these two lectures we will look at how to work with lists and tree structures. Since both are defined recursively it is natural to use recursion when defining functions over them. Recursively defined functions are very powerful in that they are easier to verify and analyse.

You should also have done the following exercises.

Elixir concepts

After the lecture

Work with the first assignment .