nice work
congratulations
--
--
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 t
great
congrats
Op maandag 23 september 2013 23:25:25 UTC+2 schreef Dmitry Groshev:
>
> Today Google Summer of Code finally ends. NDArray is pretty stable now and
> will be the default implementation used by core.matrix in the upcoming
> release. It was an epic journey through bugs, unexpected sl
Interesting, can you please explain somewhat more?
On Saturday, September 21, 2013 3:19:16 AM UTC+4, Ambrose Bonnaire-Sergeant
wrote:
>
> Just a thought, could implementing IKeywordInvoke and using keywords for
> field lookups speed up compilation?
>
> Thanks,
> Ambrose
>
>
> On Fri, Sep 20, 201
I mean something like what defrecord does:
(defprotocol SumProto
(sum [x y]))
(declare ->Pair)
(deftype Pair [^long a ^long b]
clojure.lang.ILookup
(valAt [this k]
(case k
:a a
:b b))
SumProto
(sum [x y]
(let [new-a (+ (:a x) (:a y))
new-b (+ (:b x) (:b y
defrecord uses IKeywordLookup's getLookupThunk, but I can't figure out how
to implement it.
Thanks,
Ambrose
On Tue, Sep 24, 2013 at 5:16 PM, Ambrose Bonnaire-Sergeant <
abonnaireserge...@gmail.com> wrote:
> I mean something like what defrecord does:
>
> (defprotocol SumProto
> (sum [x y]))
>
I'm curious how this relates to core.logic. If I understand correctly,
Clara can be compiled to core.logic and utilize it's search, doesn't it?
On Tuesday, September 24, 2013 6:16:12 AM UTC+4, Ryan Brush wrote:
>
> This is the first release of Clara, forward-chaining rules in Clojure.
>
> Detail
Clara is a forward-chaining production system -- think Jess, Drools or
CLIPS (but in pure Clojure, of course.). Core.logic offers constraint-based
logic programming, more along the lines of Prolog and obviously with a
strong relationship to Kanren.
These approaches are complementary; which one
I want to use clojure to build a web service with a RESTful API that
exposes resources stored in a relational database (mysql in this case). I'd
like to use a library that, given a specification of the db schema, would
translate incoming requests to db queries, or korma constructs.
Examples m
Impressive work congrats!
On Mon, Sep 23, 2013 at 11:38 AM, Maik Schünemann wrote:
> GSoC ends today and I can announce the 0.2.0 version of the expresso [1]
> library.
> It is build on top of core.logic and core.matrix and provides symbolic
> manipulation of algebraic expressions.
>
> What's t
U... OData maybe a bit overwhelming, but I guess it is in your direction
http://www.odata.org/
There is an implementation in Java
https://code.google.com/p/odata4j/
(apparently with consumers and producers, too)
There is an experimental Clojure project consuming odata4j
https://github.com/da
I am so excited about how neko and lein-droid have come along; Alex has
done some amazing work. Compared to Android's standard Java/XML approach,
it's really a revelation to write your UI and logic in the same simple
Clojure code. For the types of apps that don't require instant boot times,
I t
Hi Bill,
Did you look at restSQL? http://restsql.org
For custom needs generating SQL from REST routes might be a way.
Shantanu
On Tuesday, 24 September 2013 19:05:38 UTC+5:30, Bill Piel wrote:
>
> I want to use clojure to build a web service with a RESTful API that
> exposes resources stored i
I posted an article detailing the approaches I outlined earlier in this
thread:
http://programming-puzzler.blogspot.com/2013/09/defeating-stack-overflows.html
--
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clo
Hi all,
does anyone have a clue why light-table 0.5.3 throws exception whenever
it sees a (set! *unchecked-math* true)?
I mean it swallows (set! *warn-on-reflection* true) just fine! Is this a
bug?
the actual exception is
(set! *warn-on-reflection* true)
(set! *unchecked-math* true)
java.lan
I have registered a suite for Thursday and Friday nights at the
conference hotel (Embassy Suites Alexandria - Old Town), but I
only need the main room. So, the second room (and sofa bed) is
available.
I'm open to sharing the suite with another (quiet, non-smoking)
Clojurist. If you are intereste
I see your point. By the way, the documentation is outstanding, especially
for first release. Great work!
On the other hand, I can't help but think that Rete algorithm looks like a
part of logic programming system. I understand that this is a corner case
(Prolog does a lot more than just scanni
I appreciate the kind words!
You're right that the lines between forward- and backward-chaining systems
are blurry, with some systems incorporating ideas from both. Perhaps more
important than that is how easily we can express the logic for a given
problem. While it's possible to write, say, a
I used CLIPS (another forward-chaining rule system) for several years, and
the way I tend to explain it to people is that it is the best tool for the
job when your code would look like an enormous cond with thousands of
cases, executed over and over, because:
1. The Rete algorithm can "jump to th
+1
On Tue, Sep 24, 2013 at 9:00 PM, Mark Engelberg wrote:
> I used CLIPS (another forward-chaining rule system) for several years, and
> the way I tend to explain it to people is that it is the best tool for the
> job when your code would look like an enormous cond with thousands of
> cases, exe
19 matches
Mail list logo
