On Mar 30, 2012, at 5:11 PM, Cedric Greevey wrote: > > That opens a giant can of worms. How, for example, do we discover that > (partial * 2) and #(* % 2) and (fn [x] (* 2 x)) and #(+ %1 %1) are all > equal? Nevermind once we get into situations like #(reduce + (map > (constantly 1) %) equals #(loop [n 0 s (seq %)] (if s (recur (inc n) > (next s)) n) equals count.
In fact that's an uncomputable can of worms. But detecting identity of functions that were defined using exactly the same code is computable, whether or not it's advisable or useful (which I don't know). -Lee -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
