Aller au menu Aller au contenu
Academics
Academics
Academics

> Study at Esisar

- 2AMCS212

A+Augmenter la taille du texteA-Réduire la taille du texteImprimer le documentEnvoyer cette page par mail cet article Facebook Twitter Linked In
  • 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

Calendar

The course exists in the following branches:

  • Curriculum - First cycle - Semester 4
see the course schedule for 2021-2022

Additional Information

Course ID : 2AMCS212
Course language(s): FR

The course is attached to the following structures:

  • Team Computer Science

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 cet article Facebook Twitter Linked In

Date of update June 25, 2015

Université Grenoble Alpes