Re: [MLton] towards type checking let polymorphism

On Wed, May 20, 2015 at 06:02:23PM +0800, Baojian Hua wrote:
> I'm reading Pierce's text "Types and Programming language". On page
> 334 of that book, there is an example program of nested let binding
> and says that the type checking would be very slow.
>  
> And I'm curious about the typing checking time, so I tried this program
> both in SML/NJ and MLton. But I'm a little surprised to see that the
> checking time of the NJ compiler is indeed very slow (I kill the 
> process after running several minutes); however, MLton
> will check that program very quickly. I'm curious about how this 
> different behavior happens? Is there any special trick that MLton uses
> to handle this case?

Can you post the program?

------------------------------------------------------------------------------
One dashboard for servers and applications across Physical-Virtual-Cloud 
Widest out-of-the-box monitoring support with 50+ applications
Performance metrics, stats and reports that give you Actionable Insights
Deep dive visibility with transaction tracing using APM Insight.
http://ad.doubleclick.net/ddm/clk/290420510;117567292;y