Towards a more perfect union type | Michał J. Gajda | Scientist and developer ABSTRACT Typing dynamic languages has been long considered a challenge. The importance of the task has grown with the ubiquity of cloud application programming interfaces (APIs) utilizing JavaScript object notation (JSON), where one needs to infer the structure having only a limited number of sample documents available. Previous research has suggested it is possible to infer adequate type mappings from sample data. In this presentation, Michał presents a reseach where he and Mikhail Lazarev expands on these results. They propose a modular framework for defining type systems of programming languages as learning algorithms subject to a set of equations, and evaluate its performance on inference of Haskell data types from JSON API examples." Authors: Michał J. Gajda & Mikhail Lazarev • Follow us on social: Twitter: https://twitter.com/LambdaDays LinkedIn: https://www.linkedin.com/company/lambda-days/ • Looking for a unique learning experience? Attend the next Code Sync conference near you! See what’s coming up at: https://codesync.global • SUBSCRIBE TO OUR CHANNEL https://www.youtube.com/channel/UC47eUBNO8KBH_V8AfowOWOw