On 10/04/2011 04:22, wren ng thornton wrote:
The thing is that a lot of the common optimizations (e.g., TCO)
completely wreck the inductive structure of the function which, in turn,
makes it difficult to say interesting things about them.[1]
Could you point me to some Haskell references
It is a common situation when one has two implementations of
the same function, one being straightforward but slow, and the
other being fast but complex. It would be nice to be able to check
if these two versions are equal to catch bugs in the more complex
implementation.
This common
2011/4/9 Grigory Sarnitskiy sargrig...@ya.ru:
I guess that deciding whether two functions are equal in most cases is
algorithmically impossible. However maybe there exists quite a large domain
of decidable cases? If so, how can I employ that in Haskell?
It is a common situation when one has
Excerpts from Grigory Sarnitskiy's message of Sat Apr 09 13:26:28 -0400 2011:
I guess that deciding whether two functions are equal in most cases is
algorithmically impossible. However maybe there exists quite a large domain
of decidable cases? If so, how can I employ that in Haskell?
In the
On Sat, Apr 9, 2011 at 11:26 AM, Grigory Sarnitskiy sargrig...@ya.ruwrote:
I guess that deciding whether two functions are equal in most cases is
algorithmically impossible. However maybe there exists quite a large domain
of decidable cases? If so, how can I employ that in Haskell?
It is a
