Lecture

Types in Lambda Calculus

Description

This lecture introduces the concept of types in lambda calculus, focusing on two example languages: typing arithmetic expressions and simply typed lambda calculus. The instructor explains how to define types, specify typing rules, and prove soundness. The lecture covers topics such as evaluation rules, type safety, typechecking algorithm, canonical forms, progress, preservation, and properties of the typing relation.

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.