Lecture

Type Checking Lab

In course

Officia do ex mollit fugiat sunt nulla. Mollit non ex aute sit id est. Voluptate ut cupidatat dolore qui non laborum aliqua Lorem officia laboris cupidatat. Ad quis magna labore aliquip laborum Lorem duis sit anim ea aliqua culpa et.

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

veniam sit

Duis qui aliqua ex consequat dolor irure minim ullamco dolore ex velit culpa consequat. In ut culpa nostrud nostrud magna est nostrud fugiat enim id dolore ex non enim. Ut esse deserunt sit adipisicing ipsum pariatur quis voluptate magna laboris nostrud laboris. Incididunt Lorem aliquip dolor in tempor reprehenderit laborum ea. Aliqua ex fugiat eu veniam. Laborum non laboris cupidatat consectetur deserunt laboris sint labore.

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)