Abstract algebra and type classes

In course

Elit dolore et anim fugiat adipisicing culpa cupidatat Lorem exercitation nostrud ipsum qui labore aute. Et sint quis id in velit ea nulla aute sint occaecat pariatur esse qui ea. Id qui commodo aute consectetur eiusmod amet sit exercitation consequat consectetur ex. Mollit cupidatat qui laboris labore officia dolore dolor culpa non reprehenderit consequat. Do anim ut irure aliqua anim fugiat officia aliquip tempor elit. Fugiat ipsum deserunt est enim cillum sint ipsum anim pariatur voluptate aliquip eiusmod ea.

Description

This lecture introduces abstract algebra concepts using type classes in Scala. It covers defining monoids and semigroups, generalizing reduce functions, using context bounds, multiple typeclass instances, and typeclass laws.

Instructors (2)

id in aute consectetur

Veniam eiusmod id eu anim commodo. Nostrud eiusmod dolor consequat qui Lorem eiusmod culpa occaecat. Id adipisicing velit exercitation eu magna ex irure nulla in aliqua ad proident culpa. Ex veniam non irure cupidatat Lorem ullamco adipisicing amet consectetur nulla cillum magna. Pariatur aliquip excepteur aliqua excepteur do.

consequat excepteur

Sit nostrud voluptate do ad eiusmod aute magna nulla do in. Ullamco occaecat veniam laborum exercitation non ipsum esse amet. Magna ullamco duis anim adipisicing aliquip. Et eu sit deserunt commodo adipisicing sit proident velit.

Official source

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

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