[mercury-users] Higher-order unification question

[Ralph Becket]

doug.auclair at logicaltypes.com, Tuesday, 27 February 2007:
> Dear Mark, thanks for your reply.  You concluded:
> 
> >The short answer is that if we had a fully constraint-based type checker, the
> >implementation would be fairly straightforward.
> 
> I talked with Zoltan at the 2006 ICFP, and he mentioned this as a goal.  We've
> also seen a great deal of work on including constraint-based programming
> into Mercury.  Has it worked its way into the type-checker?

Unfortunately not: all of our time is currently taken up on the G12
constraints project and so far there's been no pressing need, for that
project, to reimplement the type checker.
--------------------------------------------------------------------------
mercury-users mailing list
Post messages to:       mercury-users at csse.unimelb.edu.au
Administrative Queries: owner-mercury-users at csse.unimelb.edu.au
Subscriptions:          mercury-users-request at csse.unimelb.edu.au
--------------------------------------------------------------------------