Let's say that lists are defined as
List a = Nil | Cons a (List a)
Then, in Haskell is
List x the greatest or least fixpoint? I'm asking because the lfp should exclude infinite lists (but you can build them in Haskell), whereas the gfp should exclude finite ones.