>From what you say, in a subsequent message, about the strictness being "b",
>that means the strictness analyser has decided that $fNumFixed2 is bottom
>(i.e. diverges). So there's no point in exposing the unfolding, because (one
>way or another) it's an infinite loop, so there's no point in op
Hello Simon,
Thank you for your reply, I am indeed using undecidable instances.
The type of the "offending" dictionary is: forall (n::GHC.TypeLits.Nat).
(GHC.TypeLits.<=) 1 n
Indeed, part of the context for my 'Num' instance is: 1 <= n
Where GHC.TypeLits defines: type x <= y = (x <=? y) ~ True
I
> I don't really get why this GHC.TypeLits constraint is a bottom dictionary...
> Is it because all Coercions/Constraints are bottom?
> Is there perhaps a set of flags I can use so that I can see the Core term
> corresponding to CLaSH.Sized.Fixed.$fNumFixed2 during compilation?
I guess I straig
