towards let-polymorphism

hi, 

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?

Thanks!

-Bob H.

To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].

------------------------------------------------------------------------------
BPM Camp - Free Virtual Workshop May 6th at 10am PDT/1PM EDT
Develop your own process in accordance with the BPMN 2 standard
Learn Process modeling best practices with Bonita BPM through live exercises
http://www.bonitasoft.com/be-part-of-it/events/bpm-camp-virtual- event?utm_
source=Sourceforge_BPM_Camp_5_6_15&utm_medium=email&utm_campaign=VA_SF