Re: Typed Racket

2010-07-15 Thread ntu...@googlemail.com
On Jul 15, 8:16 pm, Tomi Neste wrote: > But I don't think it would be easy to make it work with Clojure, > given how polymorphic and dynamic the language is (IMHO Scheme is not too > far from ML when it comes to type systems). Please expand. - nt -- You received this message because you are su

Typed Racket

2010-07-14 Thread ntu...@googlemail.com
For Racket (formely PLT Scheme), there exists a dialect called "Typed Racket" [1], which allows for static type checking. I wonder if it is feasible to port the typechecker to Clojure? Any ideas? - nt - [1] http://docs.racket-lang.org/ts-guide/index.html -- You received this message becaus

Re: Bit-level operations

2009-04-23 Thread ntu...@googlemail.com
On Apr 24, 2:57 am, Kevin Van Horn wrote: > 1. bit-and, bit-or, and bit-xor only take two arguments.  These are   > all associative operations, and as such should take an arbitrary   > number of arguments for the same reason that + and * take arbitrary   > number of arguments: I totally agree. I

Re: Static type guy trying to convert

2009-03-12 Thread ntu...@googlemail.com
On Mar 12, 3:22 am, Mark Engelberg wrote: > I know of someone who tracked all his bugs in a year of coding in both > Scheme (dynamic) and ML (static).  He said that there was no real > difference.  The kind of bugs that are caught by static type systems > are also quickly identified upon an initi

Re: Static type guy trying to convert

2009-03-11 Thread ntu...@googlemail.com
On Mar 11, 5:26 am, Raffael Cavallaro wrote: > Some of you may not know of Jon's behvior on comp.lang.lisp so some > background will be useful here. I would appreciate it if you would consider his arguments instead of discrediting him. His post is not insulting and contains valid arguments. So p

Re: Bug with clojure.set/intersection, clojure.set/difference etc.

2009-01-29 Thread ntu...@googlemail.com
On Jan 29, 7:10 pm, Jason Wolfe wrote: > I think this is not a bug in disj.  disj takes a *set* and an element > as input.  nil is the empty seq, which is different from the empty set > #{}. Well, then forget my remark about disj and let's concentrate on the set functions. Those operate on sets

Re: bit-and, bit-or arity question

2008-12-22 Thread ntu...@googlemail.com
On Dec 22, 12:39 am, Randall R Schulz wrote: > But I (the individual) agree, modulo a proper overloading pattern to > afford minimal overhead for the two-argument form. You mean like: (defn bit-or ([] 0) ([x] x) ([x y] (clojure.lang.Numbers/or x y)) ([x y & rest] (reduce #(clojure.

bit-and, bit-or arity question

2008-12-21 Thread ntu...@googlemail.com
Why do "bit-or" and "bit-and" only accept 2 arguments? "or" and "and" accept an arbitrary number and I think it is useful to modifiy "bit- or" and "bit-and" to accept 2 or more, for example: (defn my-bit-or [x y & rest] (reduce #(clojure.lang.Numbers/or %1 %2) (list* x y rest))) What does the

Re: compile and gen-class don't seem to work for me

2008-12-12 Thread ntu...@googlemail.com
Ignore me. I forgot to set *compile-path*. Everything works fine after that. Sorry for the noise. On Dec 12, 9:39 pm, ntu...@googlemail.com wrote: > For the first time I tried to use gen-class (using svn r1156), but > unfortunately compilation fails: > > u...@computer /tmp $ mk