Path: csiph.com!usenet.pasdenom.info!aioe.org!.POSTED!not-for-mail From: Gina Engli Newsgroups: comp.lang.java.programmer Subject: Re: Dealing with higher order operations coupled with primitives Date: Fri, 22 Jun 2012 18:25:48 -0400 Organization: Grouches Anonymous Lines: 13 Message-ID: References: <6s2dnZ1-8r4ofH7SnZ2dnUVZ_s6dnZ2d@giganews.com> NNTP-Posting-Host: QMvkqwgQTSa35o56g4Mhjg.user.speranza.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: NewsTap/3.5.5 (iPhone/iPod Touch) X-Notice: Filtered by postfilter v. 0.8.2 Xref: csiph.com comp.lang.java.programmer:15533 On 22/06/2012 4:28 PM, Aaron W. Hsu wrote: > I am setting up a series of examples that will hopefully make things > clearer. I have considered Haskell and Clojure, but what I am after is a > mature platform on which to construct a core runtime that will be used > by my compiler's output. Haskell does not fit the bill as its behavior is > too unpredictable, and Clojure still seems slower than Java, and less > general in allowing me to play games with mutation. As I understand it, your use of mutation is with Java arrays. Clojure gives you access to Java arrays, including mutation, and with type hints the array operations should be as fast as in Java.