So You Still Don’t Understand Hindley-Milner? Part 3

June 8, 2013 Amit Gupta

In Part 2, we finished defining all the formal terms and symbols you see in the StackOverflow question on the Hindley-Milner algorithm, so now we’re ready to translate what that question was asking about, namely the rules for deducing statements about type inference. Let’s get down to it!

The rules for deducing statements about type inference

Read on at my blog (since these blogs don’t support MathJax) →

About the Author

Amit Gupta

Amit joined Pivotal in 2012, where he works as Director of Product Management, Pivotal Cloud Foundry. His focus is the platform operator experience.

Follow on Twitter More Content by Amit Gupta
Previous
Why Connected Cars Will Thrive
Why Connected Cars Will Thrive

Imagine turning the heat on in your car with your mobile device a few minutes before stepping out of the ho...

Next
So You Still Don’t Understand Hindley-Milner? Part 2
So You Still Don’t Understand Hindley-Milner? Part 2

In Part 1, we said what the building blocks of the Hindley-Milner formalization would be, and in this post ...

How do you measure digital transformation?

Take the Benchmark