[mercury-users] literature polymorphic recursive calls

[Ralph Becket]

Tom Schrijvers, Tuesday, 21 June 2005:
> > Hi Tom,
> >      My memory is fading, but I think the book on Clean called "Functional
> > Programming and Parallel Graph Rewriting", which is (was?) available at the
> > Clean web site, has a discussion of the type checking algorithm of Clean
> > which includes a discussion of Hindley-Milner vs Milner-Mycroft, if that's
> > what you mean. Perhaps that's relevant?
> 
> Thanks a lot, Brian! This seems like a very good starting point for my
> purpose.

I'm curious: I thought the only difference between HM and MM was that
the latter also had rules for predicates and logical connectives?

-- Ralph
--------------------------------------------------------------------------
mercury-users mailing list
post:  mercury-users at cs.mu.oz.au
administrative address: owner-mercury-users at cs.mu.oz.au
unsubscribe: Address: mercury-users-request at cs.mu.oz.au Message: unsubscribe
subscribe:   Address: mercury-users-request at cs.mu.oz.au Message: subscribe
--------------------------------------------------------------------------