Modified euclidian algorithm haskell code to be more clear and readable

[lulucca12]

Avoided hiding values inside "where" bindings.

[Butt4cak3]

Welcome to the AAA and thanks for your contribution!

In my opinion, your changes to this code are definitely improvements, especially those to euclidSub. There are a few people here who know Haskell better than me, though, so I'll leave the actual code review to them.

There is one thing you definitely have to change. When you look at the chapter you will notice that not the entire file is visible, but only the function the current paragraph is about. Since you changed quite a bit, you will have to adjust the line numbers in the code import. That's not too difficult.

Open euclidean.md in your editor and look for the code imports for Haskell. They look like this:

{% sample lang="haskell" %}
[import:3-11, lang="haskell"](code/haskell/euclidean_example.hs)

You will have to change that one to

{% sample lang="haskell" %}
[import:2-8, lang="haskell"](code/haskell/euclidean_example.hs)

because lines 2-8 contain euclidSub. I'm sure you will figure the rest out!

[lulucca12]

I've solved it now

[Butt4cak3]

This should only import the euclidMod function without main. This was already wrong before you edited it, but if you look at all the other languages, you'll see that they all only import the one function. In other words, this should be 10-14.

[lulucca12]

ok, sorry 😄

[Butt4cak3]

It's alright. As I said, it was wrong before you changed it, so no worries.

[jiegillet]

print already returns IO (), is adding return () a thing?

[lulucca12]

Since you already added the IO() in the type, you can omit it, I'll fix it

[jiegillet]

Again, I didn't write this :p (I wrote all other Haskell files though, I think)

[jiegillet]

Nice improvements, thank you!