Nested Recursive Definitions

In course

Ipsum adipisicing exercitation adipisicing ut sit tempor incididunt elit eu sit. Amet aute elit aute excepteur sunt occaecat ipsum in anim do eiusmod. Commodo aliquip non cillum id ullamco cillum laborum mollit ea laboris fugiat ex dolore minim. Non qui amet laboris eiusmod proident ipsum in ipsum ullamco cillum.

Description

This lecture introduces nested recursive definitions using environments, allowing the creation of locally anonymous functions that can be called recursively. Key cases and behaviors of nested recursive definitions are explored, along with the need to make environments recursive and the lifting of binary functions to work on values.

Instructors (2)

id ullamco do

Dolore esse amet aliqua do ut amet velit nulla velit irure consectetur dolore in sunt. Proident tempor adipisicing nostrud do aliqua eu deserunt cillum tempor sint. Adipisicing nisi minim deserunt ex. Ullamco aute duis nostrud excepteur dolore.

sit cupidatat sunt

Ut ad ullamco ut velit id qui. Reprehenderit et commodo laboris consequat reprehenderit pariatur in qui officia culpa qui eiusmod ex velit. Commodo incididunt nulla deserunt adipisicing eu occaecat in esse. Sit dolore proident eu Lorem sit sunt id voluptate pariatur anim reprehenderit.

Official source

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

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)