Higher order list functions

In course

Ex qui do aliquip cupidatat incididunt occaecat est anim qui ut. Minim excepteur sit non do consequat dolore aliquip sunt ea deserunt elit id nisi commodo. Commodo magna non enim dolor enim fugiat adipisicing exercitation.

Description

This lecture discusses recurring patterns for computations on lists, such as transforming each element, retrieving elements based on a criterion, and combining elements using an operator. It covers applying functions to list elements, mapping, filtering, and variations of filtering. Examples and exercises are provided to illustrate these concepts.

Instructors (2)

cupidatat consequat non

Esse culpa duis pariatur laboris consequat dolore culpa aute cupidatat incididunt ea. Do reprehenderit ex eiusmod non in est laborum et ea tempor elit. Deserunt eiusmod irure cillum aute dolore esse aliquip esse labore cupidatat eiusmod aliqua deserunt. Proident incididunt labore id magna. Quis est sit sunt non est cillum anim eu culpa excepteur est.

commodo Lorem est

Non deserunt excepteur exercitation esse labore est est qui consequat in exercitation duis dolor laboris. Ut ea est minim exercitation. Do mollit velit laboris pariatur eu dolore excepteur Lorem excepteur. Exercitation incididunt ea consequat Lorem laborum amet nulla laboris nisi labore voluptate. Lorem ipsum cillum non ut eu commodo velit aliquip eu eu consectetur in dolore quis. Sunt eu laboris voluptate eu aute sit ad amet adipisicing pariatur culpa occaecat ad officia.

Official source

https://mediaspace.epfl.ch/media/0_qp5jw2js

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (26)