Added Haskell

Haskell/haskell_fibonacci.hs

@@ -0,0 +1,7 @@
+sum' :: Int -> Int
+sum' 0 = 1
+sum' 1 = 1
+sum' x = sum' (x-1) + sum' (x-2)
+
+fibonacci :: [Int]
+fibonacci = [sum' x | x <- [0,1..]]

Languages.md

@@ -14,6 +14,7 @@ Hello there!!
 - C++
 - Dart
 - Go
+- Haskell
 - Java
 - Javascript
 - Kotlin

fibonacci_series/Haskell/haskell_fibonacci.hs

@@ -0,0 +1,15 @@
+-- Creating the summing function
+-- Made with pattern matching
+sum' :: Int -> Int
+sum' 0 = 1
+sum' 1 = 1
+sum' x = sum' (x-1) + sum' (x-2)
+
+-- Recursive function to create as many elements as you need
+-- Since Haskell is lazy, it will only evaluate as many values as you are needing it to
+neverEndingFibonacci :: [Int]
+neverEndingFibonacci = [sum' x | x <- [0,1..]]
+
+-- To comply with the outlined rules in CONTRIBUTING.md
+-- returns x amount of the sequence in a list 
+fibonacci x = take x neverEndingFibonacci