Higher-Order Functions

In course

Non consequat proident deserunt minim irure labore esse cupidatat minim officia in. Cillum enim aliqua in dolore cupidatat. Ipsum laborum in commodo nostrud. Nulla laborum reprehenderit occaecat sint incididunt laboris elit veniam cupidatat pariatur officia consequat tempor est. Incididunt occaecat et Lorem sunt.

Description

This lecture introduces higher-order functions, which are functions that can be passed as parameters and returned as results. It covers examples of summing integers, cubes, and factorials, as well as defining function types and anonymous functions.

Instructors (2)

Amet sunt cillum cupidatat et aliqua id aliqua nulla tempor. Sit commodo Lorem consectetur fugiat. Dolore aliqua reprehenderit ullamco officia incididunt labore. Ut proident ut nostrud deserunt sunt cillum eiusmod duis sunt. Officia in do laborum aute mollit laborum est duis ad irure pariatur.

Quis officia et ea aliqua magna reprehenderit tempor officia tempor qui. Qui nostrud consectetur occaecat sint occaecat enim proident incididunt cillum. Et fugiat ex proident reprehenderit dolore laboris elit. Proident elit est dolore labore enim non irure non. Nostrud eiusmod eiusmod amet sint dolor.

Official source

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

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)