Till KTH:s startsida Till KTH:s startsida

Ändringar mellan två versioner

Här visas ändringar i "Lists and recursion" mellan 2018-01-22 11:59 av Johan Montelius och 2018-01-22 12:01 av Johan Montelius.

Visa < föregående | nästa > ändring.

Lists, trees and recursion

In these two lectures we will look at how to work with lists structures. Since lists 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 analyze.


* recursion.pdf
You should also have done the following exercises.


* introduction.pdf
Elixir concepts
* Elixir: Linked lists
* Elixir: Tuples
* Elixir: Case, cond and if
* Elixir: Modules and functions
* Elixir: Recursion
After the lecture Work with the first assignment .