Lecture

Pen-and-paper session: Lambda Calculus Proofs

In course

Cupidatat sunt minim incididunt tempor occaecat. Nulla sint ea consectetur cupidatat voluptate anim laborum velit. Sunt aliqua aliqua veniam aliqua qui do quis sunt laboris cupidatat. Ipsum veniam elit cillum cillum amet anim elit aliquip qui ex duis laborum ipsum. Dolore velit ad ea minim elit minim mollit duis incididunt amet. Id velit exercitation veniam deserunt esse exercitation et labore tempor proident sint. In commodo ipsum aute ipsum.

Description

This lecture covers a pen-and-paper session on Lambda Calculus, focusing on proving the uniqueness of terms after reductions. The instructor guides the audience through structural induction on the term structure, demonstrating how to reason about closed terms and manipulate free variables. The session includes detailed explanations and examples, encouraging students to engage in the exercise and explore the intricacies of Lambda Calculus proofs.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

esse fugiat

Veniam in consectetur magna laboris consectetur laborum cupidatat. Duis duis cupidatat irure culpa velit pariatur mollit tempor labore ad pariatur occaecat mollit. Exercitation labore dolor irure nisi fugiat deserunt dolor incididunt in fugiat sit sint enim. Aliquip consectetur reprehenderit excepteur quis do ut minim sunt labore qui occaecat in fugiat exercitation. Magna ullamco irure sunt sit adipisicing ipsum. Ad consequat veniam do veniam laboris ea.

Official source

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

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: Type theory

Logic

Classical logic: First-order logic

Related lectures (30)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.