[MLton-devel] Minimizing space usage in ML (fwd)

[Stephen Weeks]

> Assuming it's OK, it shouldn't be too hard to modify the pass
> (ssa/poly-equal.fun) that implements polymorphic equality to do the
> pointer manipulation.

Peter's point about turning tail recursion into non-tail recursion is
valid in MLton as well.  One way to address this would be to avoid
doing the pointer fixup when equality descends the last field of a
tuple and the field has a recursive type.  This of course would lose
some of the benefits of the optimization.


-------------------------------------------------------
This sf.net emial is sponsored by: Influence the future of 
Java(TM) technology. Join the Java Community Process(SM) (JCP(SM)) 
program now. http://ad.doubleclick.net/clk;4699841;7576301;v?
http://www.sun.com/javavote
_______________________________________________
MLton-devel mailing list
MLton-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/mlton-devel