- 2AMCS212
A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail
Number of hours
- Lectures : 9.0
- Tutorials : 9.0
- Laboratory works : 9.0
- Projects : -
- Internship : -
- Written tests : -
ECTS : 2.0
-
Officials : Yann KIEFFER
Goals
At the end of the course, the student should be able to:
- handle elaborate data structures (linked lists, trees);
- design a recursive routine working on an elaborate data structure;
- program with a statically-typed functional language (like Haskell or CaML), sticking to a pure subset of the language (inducing few or no side-effects).
Content - Expressions; use of toplevel evalulation loop;
- Basic types; type constructors (lists, ...);
- Defining recursive functions;
- Type definitions: enumerated types, product types, sum types.
- Type classes;
- Applications to the design of more complex data structures;
- Side effects: the case of input/output.
Prerequisites- The mathematical notion of function
- Basics on algorithmics and data structures
Tests E: exam
TP: lab sessions evaluation
Additional Information Course ID : 2AMCS212
Course language(s): 
The course is attached to the following structures:
You can find this course among all other courses.
Bibliography Real World Haskell, Bryan O'Sullivan, John Goerzen & Don Stewart, O'Reilly (Ed).
Purely Functional Data Structures, Chris Okasaki, Cambridge University Press.
A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail
Date of update June 25, 2015