Lecture

Types in Lambda Calculus

In course
DEMO: est voluptate
Nulla sit id laboris cillum deserunt est reprehenderit ut id non. Quis minim irure ex consectetur consequat do ex fugiat enim cillum. Eu laborum reprehenderit deserunt in. Commodo laboris esse deserunt mollit mollit dolor elit consectetur fugiat consectetur nostrud magna id elit. Deserunt qui enim culpa dolore esse incididunt fugiat. Enim id aliqua amet labore voluptate.
Login to see this section
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.

Instructor
pariatur quis ipsum dolore
Magna tempor ex velit excepteur quis fugiat fugiat. Non aliqua veniam ipsum ea ullamco do eiusmod anim ullamco ea magna aliqua. Officia reprehenderit non elit do qui fugiat consectetur eiusmod. Pariatur esse cillum nostrud quis non pariatur anim tempor duis ex qui et. Amet velit id commodo elit est excepteur adipisicing reprehenderit ea nisi cillum velit proident. Voluptate cupidatat elit excepteur occaecat officia Lorem ex mollit mollit minim velit. Consequat commodo aute mollit eiusmod dolor enim tempor officia excepteur laboris.
Login to see this section
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.
Related lectures (42)
Foundations of Scala: Modelling and Type Systems
Covers the foundations of Scala, including modelling recursive types, parameterized types, and variance.
Type Systems: Preservation and Typing Rules
Covers preservation, substitution, weakening, and sequencing in type systems.
Advanced C Data Types
Covers advanced data types and memory management in C programming, emphasizing type consistency and dynamic array allocation.
Coq Workshop: Introduction to Interactive Theorem Proving
Introduces Coq, an interactive theorem assistant based on the Curry-Howard isomorphism.
Show more