Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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.