Lecture

Type Rules: Progress, Preservation

In course

Cupidatat enim amet duis incididunt exercitation nulla elit duis pariatur duis labore adipisicing non. Irure laboris sint veniam aliqua ex deserunt excepteur duis mollit excepteur sint aliqua. Excepteur fugiat duis deserunt tempor sint incididunt proident.

Description

This lecture covers type rules in operational semantics, ensuring program type checking, soundness through progress and preservation, and proof of progress and preservation using induction on terms. It also discusses user-defined functions and substitution in type derivations.

Instructor

voluptate laborum aliqua

Anim ex eu dolor exercitation amet quis minim consectetur officia. Officia aute cupidatat eu ea commodo duis duis minim minim exercitation esse commodo. Eu esse anim incididunt in duis cupidatat. Cupidatat aute reprehenderit dolore sint qui esse exercitation anim sunt ullamco.

Official source

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

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

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.