recursion - Haskell function to recursively remove all occurrences of a given value in a list

Question

(Closed). This question needs details or clarity. It is not currently accepting answers. question from:https://stackoverflow.com/questions/66055222/haskell-function-to-recursively-remove-all-occurrences-of-a-given-value-in-a-lis

Answer 1

so many errors and typos, probable read little more about the language!

I guess that's what you're trying to do

myRemove :: Eq a => a -> [a] -> [a]
myRemove a [] = []
myRemove a (x:xs) | a==x      = myRemove a xs
                  | otherwise = x:(myRemove a xs)

when run with the input

> myRemove 2 [2,1,2,3,2,1,2,3,4]
[1,3,1,3,4]