On Sat, Mar 17, 2012 at 5:59 PM, Andru Gheorghiu <androi...@gmail.com>wrote:
> Hello, > > I am a third year student majoring in computer science and I am > interested in the Clojure code optimizer project proposed for GSoC > 2012. Could you please give more details (or examples) on the types of > optimizations the optimizer should be able to do? Also, what is a tree > shaker implementation? > As far as I know this is dead-code elimination. > I was thinking that an optimizer could be implemented as a rule engine > similar to Jess or CLIPS in which rules contains patterns which need > to be replaced and the code to replace them with. For example one > could write patterns for generic linear recursive functions that > should be replaced with linear iterative functions. Similarly patterns > can be written for functions which replicate the behavior of an > already existing function (such as reverse, map, apply etc) and a rule > to replace those functions with the predefined ones. > > Thank you, > Andru Gheorghiu There's actually some work happening along these lines with Kibit, https://github.com/jonase/kibit. Is this something that interests you? David -- 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
