>>51
>>50
`I don't know where you get your ideas, TJ`
Haskell can have any kinds of fucking trees, including but not limited to the lisp lists. For instance like this:
data Tree a = Empty | Node a (Tree a) (Tree a) deriving (Show)
The type system handles them like any other fucking type. Type inference works. You can even save time if you want to walk down a path in a tree without evaluating it whole, thanks to laziness.
Get your heads out of your SICP archaism and read about fucking Haskell which can do everything Lisp can, and more.
http://learnyouahaskell.com/zippers