Algebraic data types: Difference between revisions

m
m (Added some empty lines.)
m (→‎{{header|Tailspin}}: better text)
Line 2,112:
{{trans|Haskell}}
 
Tailspin doesn't have algebraic types or type names, so here using a tag. Neither does it have destructuring (which seems to be posited in the typeproblem ofstatement). Arguably, pattern matching in Tailspin is more readable while still as concise.
that is posited in the problem statement. Arguably Tailspin is more readable while still as concise.
<lang tailspin>
processor RedBlackTree
Anonymous user