FP vs. OO, from the trenches

Re:FP vs. OO, from the trenches by jes5199 on Monday July 22, 2013 @06:22PM (#6086854)

My litmus test for whether a language really succesfully marries OO and FP is: how well does a language blend pattern matching syntax and inheritance?

OCaml - basically only gives you pattern matching on primitive types. Object types end up having dramatically different code style

Scala - any syntax that deals with types quickly becomes so complicated that you can't explain it to non-experts

I don't know much about F#.

I've heard that Clojure's core.match grants pattern matching over abstract interfaces in a nice style. It's not an official part of the language, yet, though.

[ Parent | on HN ]

Re:FP vs. OO, from the trenches by chris-martin on Monday July 22, 2013 @11:06PM (#6088002)

What is complex about Scala's pattern matching? x matches the value x, x:A matches instances of A, A(x) matches if A.unapply(x) evaluates to a Some, and _ matches anything. Erasure throws a wrench into it, but otherwise it's pretty straightforward.

[ Parent | on HN ]

Re:FP vs. OO, from the trenches by platz on Monday July 22, 2013 @10:28PM (#6087838)

This is a nice point to think about, thanks - I'll have to do some noodling on this.

[ Parent | on HN ]