Dear Martin,
By "black-holing" you probably mean co-induction. That is,
if the statement to proven appears again, we assume it must hold.
However, type classes are by default inductive, so there's no
easy fix to offer to your problem.
A propos: are there fundamental objections to coinductive r
Stefan
You are trying to do something quite delicate here.
The whole idea of solving constraints in a co-inductive way (building a
recursive group of dictionary definitions) relies on spotting something we've
seen before to "tie the knot". To date, the main application I knew for this
fairl
2009/9/9 Stefan Holdermans
> Dear Martin,
>
> By "black-holing" you probably mean co-induction. That is,
>> if the statement to proven appears again, we assume it must hold.
>> However, type classes are by default inductive, so there's no
>> easy fix to offer to your problem.
>>
>
> A propos: ar
