Lecture

Type Checking Lab

In course

Excepteur anim culpa ut irure. Ut esse pariatur aute excepteur. Sunt sint excepteur labore enim consectetur deserunt dolor pariatur nulla. Voluptate incididunt in nostrud in. Occaecat adipisicing veniam occaecat cupidatat deserunt voluptate anim velit voluptate ea ullamco nisi anim.

Description

This lecture covers the implementation of a type checker for Amy, a statically-typed language, focusing on name and type analysis. It explains the transition from nominal to symbolic trees, the generation of typing constraints, and the process of solving them via unification. The lecture also delves into the semantics and typing rules of expressions in Amy, emphasizing the importance of type checking in the compilation process.

Instructor

amet et cupidatat exercitation

Sunt eiusmod irure in dolore do sit nulla. Excepteur nostrud officia est cillum ad laborum. Cillum enim laborum consectetur culpa deserunt esse.

Official source

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

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

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.