Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism · HackerPapers discussions

Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism — mentioned by throwaway17_17

Sun, 27 Sep 2020 05:55:09 GMT

I certainly have a lot of recommendations that are topic adjacent, but most of my comment comes from mental revision. I have a horrible habit of reliving previous arguments and trying to find out what I could have said better to win the argument. I had an argument with a law school classmate who had a Masters in Mathematics (now a PhD) while we were on a road trip from Paris to Normandy, during summer abroad, and then ‘invented/discovered’ nature of mathematics was the real crux of the argument. I have spend the last 12 years going over and over and over that argument trying to win it and my…

Paper and discussion history. A mention is not an endorsement.

Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism — mentioned by yorwba

Mon, 30 Oct 2017 12:20:33 GMT

ArXiv link for the paper: https://arxiv.org/abs/1306.6032

Paper and discussion history. A mention is not an endorsement.

Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism — mentioned by iitalics

Sun, 20 Aug 2017 23:33:04 GMT

Hindley-Milner is cool, but if you're planning on implementing a language with type inference, I strongly suggest you take inspiration from bidirectional type inference, notably Pierce-Turner[1] and subsequently Dunfield-Krishnaswami[2]. These algorithms are capable of inferring much more complex types and generally produce better error messages. Typically, there are very few programs which can't be typed when you combine Dunfield-Krishnaswami type inference and have the user place annotations on major function definitions. [1] http://www.cis.upenn.edu/~bcpierce/papers/lti-toplas.pdf [2]…

Paper and discussion history. A mention is not an endorsement.