Type Inference for Application Spines in Higher-Order Languages - WITS'24

Explore type inference for application spines in higher-order, curried languages like Haskell in this 34-minute conference talk by Simon Peyton Jones at ACM SIGPLAN's WITS'24. Delve into the advantages of typechecking application spines as a whole, including improved user experience through better error messages, implementation of impredicative polymorphism, handling of visible type application, and management of required type arguments. Learn how treating applications holistically addresses challenges in type inference and checking, particularly in cases where type and term arguments are arbitrarily mixed. Gain insights into the evolution of GHC's approach to type inference and its impact on language features and user experience.