Derek Elkins wrote:
On Tue, 2007-07-31 at 23:04 -0700, Stefan O'Rear wrote:
> On Wed, Aug 01, 2007 at 03:44:32PM +1000, Thomas Conway wrote:
> > This sounds like a common problem type. Is there a well known solution
> > to this sort of problem?
>
> Mmm... logic programming?
>
>
http://citeseer.ist.psu.edu/claessen00typed.html>
> You'll only need the code for logic-variables, and even that can be
> simplified because your "terms" are non-recursive. (Even in the
> recursive case, a logic program like a HM typechecker usually only needs
> ~50 lines of prelude).
If someone is interested, I did transcribe and mildly generalize the
code from that paper.
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Derek, I'd be interested in looking at that -- have you put it online?
