[Haskell-cafe] Is Curry alive?

Ross Paterson ross at soi.city.ac.uk
Fri Nov 5 06:13:43 EDT 2010

On Thu, Nov 04, 2010 at 06:06:40PM -0400, Dan Doel wrote:
> Implementing type inference can be very easy in a logic language,
> because most of the work in a non-logic language is implementing
> unification:

Provided the implementation includes the occurs check.

More information about the Haskell-Cafe mailing list