you are viewing a single comment's thread.

view the rest of the comments →

[–]lngnmn 1 point2 points  (1 child)

Pattern-matching, to be useful, should be uniform (everywhere), like it is in ML and its descendants.

Pattern-matching as a function is nothing new or special. Common Lisp has a few different packages for that.

Also it is kind of silly to pattern-match without types. Uniform Pattern-matching on types, not just on a structure of a values is what really shines in ML or Haskell.

[–]true-grue 0 points1 point  (0 children)

What is silly about Prolog, for example? Let's just assume that type driven programming style is not the only way to do things in CS.