How do I solve this infinitely recursive type problem I’ve created in Haskell with Church Numerals
data ChurchN a = ChurchN { numeral :: (a -> a) -> a -> a , litRep :: String } next :: ChurchN a -> ChurchN a next x = ChurchN { numeral = f y -> f (numeral x f y) , litRep = let (lambx, funct) = splitAt (length “f x -> “) […]