Type Inference & Unification - Isaac Elliot - BFPG 2019-03

preview_player
Показать описание

Type systems increase our confidence that code does useful things. Last month we saw how upgrading untyped lambda calculus to simply-typed lambda calculus (STLC) lead to a better-behaved language by ruling out non-termination and nonsensical operations. In this talk I introduce 'type inference', a process that allows us to type-check programs without any type annotations. We will see how it applies to STLC and beyond, and uncover the critical machinery that makes it work: unification.

(New audio system is better than the aircon noise, but I'll fiddle with the mixer next month to get rid of the clipping and hum)
Рекомендации по теме
Комментарии
Автор

I am studying for the last exam of my bachelor's which is "programming paradigms". The exam got canceled due to corona. But I got a last minute chance to take it orally on monday so I don't have to stay for a whole additional semester.
In the lecture slides there is this chapter about type inference and I just couldn't make sense of it. Thankfully I found this great talk that uses almost the same syntax as the lecture slides but with an explanation to it. So finally I undestand what the slides have been trying to tell me for the last 24hours :D
Thank you so much, this is saving my ass! :)

WoDNolz
Автор

Thanks for posting. Was this talk in Queensland?

kreshokresimir