Re: [isabelle] nat_code Equation

> Why not something tail-recursive, which, under the assumption that the
> compiler cannot optimize the above into something tail-recursive, should
> perform even better (probably except for Haskell):

Since my use-case is a more complex program in Haskell, I prefer my version,
but indeed for eager languages the tail-recursive variant is more plausible.

with nat (from library)
3.32 seconds

with my version of nat:
2.61 seconds

with your tail-rec. version of nat:
2.76 seconds

Best regards,

This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.