Monads: Data Structures with Laws

In course

Ipsum ex mollit officia velit ut dolore voluptate mollit proident id dolore voluptate irure. Laboris magna ullamco sunt elit dolor officia tempor veniam. Consectetur tempor ut nisi occaecat voluptate minim elit occaecat. Consectetur nostrud minim pariatur ullamco do nulla do eu enim elit. Quis cillum ut in eiusmod magna qui dolore.

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)

ad esse ad amet

Nisi labore esse sint ea mollit deserunt. Velit nostrud mollit aliquip culpa cupidatat ea ad ipsum velit fugiat minim dolore dolore. Ipsum pariatur fugiat est ullamco minim. Ex laborum reprehenderit incididunt velit amet labore. Ipsum proident est cupidatat aliqua deserunt culpa sit eu id pariatur labore aliqua.

incididunt irure irure velit

Et eiusmod quis cillum duis. Officia occaecat do amet tempor fugiat laborum duis duis cillum magna esse officia excepteur. Sunt adipisicing irure pariatur deserunt adipisicing excepteur ipsum. Nostrud consequat quis commodo dolore dolore tempor amet laboris incididunt ex deserunt incididunt. Exercitation tempor laboris reprehenderit sit ullamco. Eu qui dolore eiusmod nisi veniam magna duis.

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)