In article [EMAIL PROTECTED],
Jerzy Karczmarczuk [EMAIL PROTECTED] wrote:
I have just one question thus. Why the application-oriented papers devoted
to Haskell at ICFP, including the Haskell workshop are rather rare?
Perhaps people who are busy writing applications don't really bother
with
Ashley Yakeley wrote:
Would it be reasonable for the compiler to check back through the
stack and allow the circularity? It will just create an ordinary
recursive function.
The following works.
Flags: -fglasgow-exts -fallow-undecidable-instances
data D r = ZeroD | SuccD (r (D r))
Hi Ashley
See the thread Type Class Problem. In his post on Aug 22 Simon
Peyton-Jones said that it shouldn't be hard to implement, and mentioned
that it would ruin the property that dictionaries can be evaluated by
call-by-value. I couldn't puzzle out enough of the type class system to
make the
In article [EMAIL PROTECTED],
Brandon Michael Moore [EMAIL PROTECTED] wrote:
Detecting circularity in a derivation is equivalent to accepting a regular
infinite derivation for instances. Would you have a use for irregular
derivations?
Could you give me an example?
--
Ashley Yakeley,
