Re: [Haskell-cafe] Optimizing unamb by determining the "state" of a thunk?

Christopher Lane Hinson wrote:

What we'd like to avoid is duplicate verification that a thunk is hnf. Do we have evidence that this verification ever actually consumes a lot of resources?

I think the OP is trying to avoid spawning unnecessary threads at the cost of duplicate checks for HNF. - Jake