## Implementing sets efficiently in a functional language

From: "andrew cooke" <andrew@...>

Date: Fri, 2 Jan 2004 18:04:14 -0300 (CLST)

Tree balacing algorithms are usually complex. We show that this need not
be the case---the trick is to abstract away from the rebalancing scheme to
achieve a simple and efficient implementation. -
https://200.83.153.5/cgi-bin/mailman/listinfo/compute