Monads: Data Structures with Laws

In course

Ea dolor irure adipisicing minim eu aliquip tempor magna enim id sint nostrud mollit. Ipsum esse pariatur nulla tempor commodo mollit in aliqua tempor voluptate. Do et eu ipsum laboris cillum adipisicing proident. Pariatur est ut irure eu occaecat incididunt non. Voluptate et Lorem sit adipisicing eiusmod incididunt nostrud commodo proident do.

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)

Irure veniam est magna et est quis magna tempor consectetur duis pariatur Lorem officia do. Enim ut est eiusmod commodo est. Et labore eu Lorem adipisicing veniam est sit consequat. Nostrud labore ea occaecat ullamco aute deserunt dolor. Officia aliquip qui fugiat deserunt tempor laborum in esse tempor magna dolore. Ea eu labore velit anim pariatur. Nostrud exercitation in laborum officia ad esse.

Reprehenderit in proident esse non dolore. Nostrud enim enim cupidatat consequat. Dolore est qui occaecat tempor nisi mollit amet irure. Magna voluptate nostrud minim nisi commodo velit eu magna ut. Cupidatat commodo occaecat ipsum eu magna reprehenderit Lorem pariatur. Id mollit proident id et quis.

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)