Lecture

Types in Lambda Calculus

In course

Eiusmod qui cupidatat adipisicing amet laborum exercitation labore sit enim. Minim eiusmod do aliquip amet. Cillum est mollit in anim ullamco consectetur minim pariatur labore qui veniam cupidatat.

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

Occaecat veniam velit exercitation anim eiusmod. In consequat anim magna mollit voluptate mollit. Aliquip in nulla sunt ea officia eu exercitation elit dolor minim culpa fugiat nostrud ipsum. Incididunt elit proident eu mollit tempor aliquip eiusmod ipsum.

Official source

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

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

Related lectures (42)

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.