I would be grateful if Haskell implementors could share their opinion
(and/or experience) of the idea of using one of the following
linear-time unification algorithms in the type inferencer for any of
the current Haskell implementations:
- Martelli-Montanari (the linear-time algorithm, which
I believe was never published)
- Huet
- Patterson and Wegman
Thanks
--dd
------------------------------------------------------------------------------
Spoken: Dominic Duggan Internet: [EMAIL PROTECTED]
Canada: Dept of Computer Science, University of Waterloo,
Waterloo, Ontario, Canada N2L 3G1
WWW: http://nuada.uwaterloo.ca/dduggan.html
