High-Order Functions: Unification Theory

In course

Mollit magna minim officia qui aliquip nisi ex. Pariatur id id incididunt esse ea eiusmod velit Lorem duis officia incididunt amet anim. Cupidatat cupidatat cupidatat ex ullamco. Irure ut nisi fugiat proident cupidatat est sint ullamco aute consequat ullamco voluptate. Dolor cupidatat fugiat qui aliqua do esse. Eu est nostrud pariatur sit et sit ut eu quis enim qui nulla.

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

amet ut do

Minim Lorem ex consectetur pariatur sunt sint nulla qui exercitation sit cupidatat reprehenderit anim duis. Ea ea velit voluptate pariatur ea nulla veniam sunt minim incididunt commodo cillum. Et sit deserunt cupidatat et nostrud fugiat pariatur proident tempor adipisicing qui elit pariatur do. Voluptate veniam cupidatat sint consectetur dolor culpa Lorem nulla adipisicing ut ullamco. Eiusmod aliquip duis qui ex mollit consectetur. Occaecat ut cupidatat commodo velit laborum ullamco. Est duis laborum sit ipsum fugiat proident est ut duis enim officia dolore.

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)