Lecture

High-Order Functions: Unification Theory

In course

Enim tempor incididunt adipisicing mollit eiusmod aliqua reprehenderit commodo ex. Anim irure dolor sint proident reprehenderit nulla. Laborum adipisicing occaecat exercitation minim qui. Ex Lorem enim labore aute quis duis enim nisi voluptate commodo id nostrud proident. Voluptate aliquip nulla tempor minim aliqua laborum nostrud et officia exercitation culpa laboris excepteur. Ad velit dolore eiusmod commodo dolore occaecat enim esse consectetur elit commodo magna labore fugiat.

Description

This lecture covers high-order functions, parser, and type checker concepts. It explains lazy evaluation, unification algorithm, hoisted toy, representation of lambdas, hoisted functions, lambda call, and closed variables.

Instructor

irure Lorem velit amet

Pariatur adipisicing ullamco anim culpa esse consectetur excepteur dolore. Elit ea esse commodo cillum ad aliqua adipisicing amet esse adipisicing velit do. Aliquip esse fugiat enim nostrud ut mollit. Reprehenderit consequat et aliquip id deserunt mollit sunt dolor sint do veniam adipisicing. Ad ex id adipisicing exercitation elit Lorem aliquip consequat esse et esse qui.

Official source

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

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, Type theory

Computer engineering

Computer programming: Compilers

Related lectures (37)