[Haskell-beginners] Query regarding an unusually behaving code

[akash g]

This is because the second let redefines your first definition.  Hence, you
don't have  a base case anymore.

digs 0 =[]
digs x = (digs (x `div` 10)) ++ [(x `rem` 10)]

When I compile this with ghc though, it works fine.

This is how ghci works, I'd presume.

On Fri, Nov 13, 2015 at 12:06 PM, Abhishek Kumar <abhishekkmr18 at gmail.com>
wrote:

> Bellow is my code for returning a list of digits given an integer.I'm
> unable to find any bug in it but somehow it crashes any computer I run it
> on when I try to calculate digs 100.Please tell me bug in my code.
>
> let digs 0 =[0]
> let digs x = (digs (x `div` 10)) ++ [(x `rem` 10)]
> digs 100
>
> Thanks
> Abhishek
>
> _______________________________________________
> Beginners mailing list
> Beginners at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/beginners/attachments/20151113/6e961e8e/attachment.html>