Continuing my series of posts comparing and contrasting the dynamically-typed imperative language Ruby with the strongly-typed declarative language Haskell, I’ll now examine the abilities of these languages to create mutually recursive data structures.