Lecture

Nested Recursive Definitions

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.

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.