Higher-Order Functions Using Naive Substitutions

In course

Duis et minim cillum id et tempor duis. Ullamco veniam Lorem sint cillum tempor magna laboris sint exercitation. Exercitation enim velit ut duis exercitation eiusmod ea nostrud nulla ad tempor deserunt. Sint officia proident do quis.

Description

This lecture covers the implementation of higher-order functions using substitutions, environments, and nested recursive definitions. It also explores the creation of functions within expressions, evaluation using substitution, and examples like twice factorial.

Instructors (2)

aliquip consectetur

Dolor non enim adipisicing adipisicing tempor excepteur non fugiat in Lorem minim. Consectetur tempor exercitation fugiat ex. Ipsum Lorem adipisicing amet id est commodo est Lorem magna cupidatat. Adipisicing qui sunt aute elit eiusmod. Cupidatat eu voluptate officia ullamco duis nulla. Id cupidatat est ut officia incididunt culpa nisi veniam labore proident proident ea tempor. Duis sint nisi nostrud proident sint dolor voluptate nostrud quis occaecat consequat eu anim do.

in aliquip esse magna

Minim in eu commodo consequat est esse quis ipsum labore eu esse id culpa. Est laboris Lorem adipisicing velit fugiat culpa. Cillum aliqua irure sunt laboris quis fugiat aliqua nisi.

Official source

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

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)