David Feuer David_Feuer@brown.edu
Mon, 28 Jan 2002 5:12:06 -0500

> From: Thomas Hallgren <hallgren@cse.ogi.edu>
> David Feuer wrote:
> >Has anyone written an efficient purely-functional 
> >implementation of unification (for type checking)?
> >
> Well, if you have ever used hbc or nhc, you have used 
type checkers 
> containing purely functional implementations of 
unification. Purely 
> functional unification can be efficient enough for 
practical purposes...

Thank you for this information.  However, it does not 
quite satisfy my curiosity:  are these purely functional 
type checkers as efficient (big-O) as imperative ones?  
And if not, why not?

David Feuer

This message has been brought to you by the letter alpha and the number pi.