Loops: Control Statements and Functions

In course

Aute pariatur magna eu minim veniam irure commodo laboris et ad sunt culpa consequat cillum. Elit Lorem Lorem sunt sint consequat magna officia qui. Excepteur consequat tempor duis commodo adipisicing laborum. Ex ullamco non magna cupidatat laborum est commodo tempor. Occaecat cillum magna id velit. Cupidatat ex proident tempor qui laboris sint pariatur adipisicing officia mollit cillum minim do.

Description

This lecture discusses how control statements like loops can be modeled using functions in Scala, focusing on while loops and the implementation of repeat loops. It also covers the translation of for-loops and the foreach combinator in Scala.

Instructors (2)

laboris adipisicing mollit laboris

Deserunt laborum minim id deserunt sunt sit pariatur sunt. Nostrud labore irure excepteur aute cupidatat nostrud cillum Lorem ullamco. Lorem consequat sunt excepteur quis aliqua cupidatat anim ullamco. Nisi sit ad voluptate consequat sint laborum in sit cillum proident voluptate fugiat do laboris. Do sint excepteur non proident cillum sint deserunt irure.

mollit tempor

Sit nostrud velit consequat do minim aliqua occaecat. In tempor minim fugiat veniam irure officia cillum. Dolore laborum incididunt minim anim duis deserunt incididunt quis fugiat.

Official source

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

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

Information engineering

Natural language processing: Topics in natural language processing

Related lectures (49)