[Haskell-cafe] Re: Type-Level Naturals Like Prolog?

2006-07-17 Thread Jared Warren
Thank you to everyone for the responses. I guess what I should have clarified is that I know how Peano numbers are *normally* encoded in the type language (I am very familiar with the HList library), but I would like to know why the type language appears to require data structures to do so while

Resolving Ambiguous Types

2003-11-20 Thread Jared Warren
system can avoid this problem? Thanks for your help, ~ Jared Warren [EMAIL PROTECTED] Computing Science, Queen's University ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe

Beta Reduction, undefined vs Type Classes

2003-11-09 Thread Jared Warren
to make the former work as well? Even modifying fst doesn't work: fst' :: Thing b = (a,b) - a fst' (~a,~b) = a -- ~ Jared Warren [EMAIL PROTECTED] Computing Science, Queen's University ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http