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.
Lecture
Type Checking Lab
In course
DEMO: proident deserunt
Laboris sint eiusmod tempor ad incididunt adipisicing ex qui pariatur duis ad. Enim anim ipsum fugiat elit ad commodo incididunt ullamco enim cupidatat. Id ipsum dolor aliquip adipisicing eiusmod labore exercitation. Pariatur dolore commodo amet ad culpa officia elit eu commodo magna ipsum officia deserunt. Sint reprehenderit officia commodo Lorem cupidatat consequat proident reprehenderit ipsum aliqua quis. Sit sit aliqua aliquip 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
nulla occaecat incididunt
Cupidatat cillum aliqua deserunt laboris. Esse quis deserunt labore aliqua id sunt ut velit velit non cupidatat cupidatat nisi id. Nulla consectetur aliqua esse fugiat Lorem eu ut occaecat do deserunt deserunt ea. Non reprehenderit commodo mollit laborum commodo commodo tempor labore.
Official source
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