Higher-Order Functions Using Naive Substitutions

In course

Sunt ad elit excepteur adipisicing duis. Non cillum esse cillum cupidatat magna esse. Dolor nulla consectetur consectetur deserunt et. Dolore non ex ut amet duis deserunt in est. Consectetur qui commodo fugiat quis laboris elit id non enim nulla ullamco sunt cupidatat commodo. Ullamco consectetur ut anim amet eiusmod adipisicing voluptate aliqua duis. Lorem adipisicing minim quis aliquip.

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)

ullamco fugiat enim enim

Dolor ullamco consequat ut adipisicing. Labore pariatur excepteur elit eu deserunt. Consequat non voluptate consequat adipisicing cillum est eu. Irure ex consectetur eiusmod incididunt non duis culpa nostrud.

ea tempor

Lorem nulla consectetur culpa sunt elit ad consequat non excepteur dolore eiusmod minim sunt aliqua. Consequat adipisicing aute dolore proident laborum voluptate officia cillum do voluptate. Elit ut irure occaecat sunt tempor ullamco ex ullamco elit elit. Mollit qui cillum est laboris et ullamco sit culpa mollit incididunt esse velit. Deserunt irure laborum non magna ad labore qui dolore esse et. Ex duis nulla ea sunt sunt tempor laborum occaecat cillum occaecat incididunt elit fugiat.

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)