Lambda Calculus: Operational Semantics and Evaluation Strategies

In course

Ex commodo duis quis deserunt culpa mollit elit magna minim sint anim. Do in amet ullamco eiusmod labore fugiat aliquip cillum irure commodo. Laboris labore aliquip mollit magna deserunt nulla labore. Sint mollit nisi labore amet minim exercitation laboris nulla amet deserunt mollit. Et commodo in nulla cillum commodo qui ullamco minim irure irure et Lorem. Ullamco voluptate tempor ex eu tempor irure officia nostrud do Lorem nostrud. Ea ut non deserunt fugiat nostrud et.

Description

This lecture covers operational semantics and evaluation strategies in lambda calculus. It explains computation rules, redex, alternative evaluation strategies, classical lambda calculus, full beta reduction, substitution, alpha conversion, multiple arguments, programming in lambda calculus, confluence, Church Booleans, and functions on Booleans.

Instructor

Voluptate quis non duis ad cupidatat deserunt. Fugiat tempor eu aliqua sint velit mollit veniam est culpa elit. Quis dolore incididunt anim aliquip incididunt laboris eu elit amet consequat magna dolore. Id ullamco excepteur velit velit ea cillum qui laboris. Incididunt Lorem laborum fugiat mollit eu ad reprehenderit do commodo est mollit aute tempor ex. Ut reprehenderit proident aliqua sint reprehenderit ut anim irure laborum labore duis eu.

Official source

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

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 (34)