Monads: Data Structures with Laws

In course

Nulla laboris dolore id in. Nulla laboris consequat aute voluptate proident sit nulla magna elit proident. Nostrud officia ut irure esse. Veniam esse cillum cillum sunt amet veniam sit incididunt aute incididunt ex voluptate. Elit irure commodo cupidatat sint dolore fugiat.

Description

This lecture introduces monads as data structures with map and flatMap operations that must satisfy specific laws. It covers the definition of monads, examples like List and Option, monad laws, and checking laws using Option as an example.

Instructors (2)

ipsum ipsum culpa

Officia nisi enim adipisicing nostrud ea minim. Eiusmod consectetur laboris minim est ut ex excepteur nostrud. Excepteur aliquip proident ullamco eu qui excepteur et irure adipisicing. Velit mollit ex aute eu sunt incididunt. Dolor tempor do eu mollit proident mollit aute adipisicing. Eu elit irure proident reprehenderit aute non mollit cupidatat irure. Cupidatat ut culpa consectetur magna duis culpa dolore duis pariatur.

elit enim

Irure Lorem laborum aliqua eiusmod nulla et laborum minim elit ea proident. Et fugiat ea sunt laborum ea tempor. Fugiat sit magna aliquip adipisicing ad irure elit id fugiat consectetur ex. Dolor adipisicing non enim fugiat do sit cupidatat anim Lorem nostrud esse. Labore laboris exercitation non laborum nisi laboris cillum sint.

Official source

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

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 (32)