2012-07-11
| 00:48 | noidi | sjl, save the worst error messages along with what they _should've_ said. that would make a great reference for when someone(tm) decides to do something about them :) |
| 00:49 | noidi | (re: https://twitter.com/stevelosh/status/222910504987926529) |
| 00:50 | sjl | noidi: heh, {#"No single method: .* of interface: .* found for function .*" (rand-nth ["You called a protocol method with the wrong arity" "Clojure/Lein fucked up the AOT compilation; run lein clean."])} |
| 00:51 | noidi | I don't think you should be AOT compiling anything unless you're doing interop |
| 00:52 | noidi | at least then you can just restart your REPL when things get weird, and everything gets recompiled |
| 00:52 | sjl | noidi: no, this problem persists across repl restarts |
| 00:52 | sjl | noidi: lein thinks the AOT compiled stuff is done even though I've changed a protocol |
| 00:53 | sjl | so it doesn't recompile it, and when I try to use the changed version it's still using the old one |
| 00:53 | dnolen | sjl: but what triggers AOT in the first place? |
| 00:53 | sjl | which certainly isn't going to work |
| 00:53 | sjl | dnolen: that's a wonderful question |
| 00:53 | dnolen | sjl: certainly not Clojure |
| 00:53 | sjl | dnolen: https://github.com/sjl/caves |
| 00:54 | sjl | grep -R aot . returns nothing |
| 00:54 | dnolen | sjl: are you re-compiling some namespaces interactively and not others? |
| 00:54 | noidi | I generally prefer multimethods to protocols, because they're slightly easier to deal with because of things like this |
| 00:56 | sjl | dnolen: okay I can consistently repro it, one sec |
| 00:57 | noidi | defmulti has defonce semantics, which is surprising and annoying, but once you know that you can redefine things (using ns-unmap) without restarting the repl |
| 00:57 | noidi | (well, surprising = annoying when it comes to programming) |
| 01:03 | sjl | dnolen: noidi: https://gist.github.com/3088120 |
| 01:05 | dnolen | sjl: so that only occurs under lein repl, not interactive dev? |
| 01:06 | sjl | dnolen: if by interactive dev you mean lein swank then oh no, it definitely appears there too |
| 01:06 | dnolen | sjl: so this is a bug that exists in your code right now? what's at line 39? |
| 01:06 | sjl | dnolen: it's not a bug in my code. if you run 'lein clean; lein repl' the repl works again |
| 01:08 | sjl | dnolen: that sed call changes the name of the method in the protocol, and updates the places where it's used. The problem is that Clojure thinks the protocol method still has the old name |
| 01:08 | noidi | yeah, I can reproduce it |
| 01:08 | sjl | so when I try to use the updated name, it explodes |
| 01:08 | noidi | when I run "lein repl", it tells "All namespaces already :aot compiled." |
| 01:08 | dnolen | sjl: only lein2? or lein1 as well? |
| 01:08 | sjl | and by "Clojure thinks" I mean "something in the Clojure/leiningen chain thinks" |
| 01:09 | dnolen | sjl: Clojure doesn't AOT by default. |
| 01:09 | noidi | sjl, you have caves.core marked as containing the main class for the project |
| 01:09 | sjl | dnolen: hm, no idea. I can try it with lein1 if it's not much work to backport the project file I guess... |
| 01:09 | noidi | which means caves.core needs to be AOT compiled |
| 01:09 | noidi | AOT compilation is transitive |
| 01:09 | noidi | which triggers the compilation of the protocols |
| 01:10 | sjl | noidi: Okay, so that explains the AOT compilation, but not the failure to notice updates to the files and recompile. |
| 01:10 | noidi | lein only knows that caves.core is AOT'd -- it doesn't know that it should check the other namespaces for modifications and recompile them |
| 01:11 | dnolen | noidi: I'm confused as to why lein repl should trigger AOT |
| 01:11 | sjl | It know it needs to AOT them the first time... |
| 01:11 | dnolen | noidi: regardless of project settings |
| 01:12 | noidi | dnolen, that's probably to make lein repl nicer to use with gen-class |
| 01:12 | noidi | I used to do a lot of lein compile, repl before I noticed that lein does that by default |
| 01:13 | noidi | sjl, the transitive compilation bit is done by the Clojure compiler. lein just asks it to compile clojure.core. |
| 01:13 | noidi | so I think this could be considered a bug in lein |
| 01:13 | akhudek | I guess you could ask to to AOT the whole project as a not so nice work around... |
| 01:14 | akhudek | of course beware of core.match if you do that, it doesn't work with AOT |
| 01:14 | sjl | lol |
| 01:14 | sjl | alias lein='lein2 clean; lein2' |
| 01:14 | sjl | problem solved. |
| 01:15 | akhudek | that works too :D |
| 01:15 | dnolen | akhudek: heh, yes - the warnings has since been added to the repo. |
| 01:16 | akhudek | dnolen: I discovered that the hard way :-( |
| 01:16 | dnolen | akhudek: sadly no patches yet. |
| 01:17 | dnolen | akhudek: finding AOT bug are a PITA. |
| 01:17 | dnolen | bugs |
| 01:17 | akhudek | I was pretty surprised that such a thing could even happen! |
| 01:17 | dnolen | akhudek: it easier than you think. |
| 01:17 | akhudek | I'll take your word for it. :-) |
| 01:18 | dnolen | akhudek: with enough dynamism your code can easily only make sense only at runtime. |
| 01:18 | noidi | I'd work around sjl's issue by adding (ns caves.core.Main (:gen-class :impl-ns caves.core)), and in project.clj set :main caves.core.Main |
| 01:18 | noidi | (or whatever, I never get the ns syntax right, but maybe you got the idea) |
| 01:19 | noidi | impl-ns does _not_ get transitively AOT'd so its requirements aren't either |
| 01:19 | seaword | I'm diving into my first clojure program using ring and can't get the wrap-reload syntax quite right. http://pastie.org/4235725 |
| 01:19 | noidi | but yes, the AOT stuff is quite a trainwreck at the moment |
| 01:19 | seaword | I get this error: IllegalArgumentException Parameter declaration wrap-reload should be a vector |
| 01:19 | sjl | noidi: okay it's late, what exactly does that do? |
| 01:19 | seaword | Would be grateful for a nudge in the right direction, cheers. |
| 01:19 | noidi | sjl, do you have o'reilly's clojure book? |
| 01:20 | noidi | sjl, the impl-ns trick is mentioned somewhere in it |
| 01:20 | sjl | noidi: is that programming clojure? |
| 01:20 | noidi | wait a sec, I'll check the book right now |
| 01:20 | sjl | or clojure programming? |
| 01:20 | sjl | lol naming |
| 01:20 | ssutch | is there any difference between (defn a->b [x] x) and (defn a [x] x) |
| 01:20 | dnolen | akhudek: (def foo (partial bar baz)) was one bad pattern I used. |
| 01:21 | sjl | ssutch: ... one is named 'a' and one is named 'a->b'? |
| 01:21 | ssutch | that's what i figured |
| 01:21 | ssutch | just wanted to make sure, what is the convention for using a->b? |
| 01:21 | dnolen | akhudek: extend-type was also a problem. |
| 01:21 | noidi | sjl, check the note on page 338 of Clojure Programming if you have it |
| 01:23 | sjl | noidi: the thing about the modification dates? |
| 01:23 | xumingmingv | hey guys, any comments on this? http://martinsprogrammingblog.blogspot.de/2012/02/why-is-clojure-so-slow.html |
| 01:23 | sjl | I'm quite sure the mtime is getting set when I save the file with Vim... |
| 01:24 | sjl | xumingmingv: My thoughts: "Get an SSD and don't use Clojure for shell scripts." |
| 01:24 | ivan | you can use -Xbootclasspath to reduce the startup time |
| 01:25 | ivan | that is, -Xbootclasspath/a:clojure.jar |
| 01:25 | noidi | sjl, nope, the note about gen-class and transitive dependencies. I'm talking about the o'reilly book with the bird on the cover... :P |
| 01:25 | noidi | by emerick, carper and grand |
| 01:25 | sjl | noidi: oh I have the rough cuts version -- I think the note you're talking about is on a different page for me |
| 01:26 | sjl | noidi: this thing? http://i.imgur.com/UgQLM.png |
| 01:26 | noidi | that's it |
| 01:27 | dnolen | xumingmingv: do you have some specific concern? |
| 01:27 | noidi | of course, if you don't really need to be able to run "java -jar caves.jar", just drop the :main from project.clj and be done with it >( |
| 01:27 | noidi | :) |
| 01:27 | sjl | noidi: so the solution is to make a special ns that uses some special ns voodoo to only generate one AOTed class |
| 01:27 | sjl | and then let the rest of the project be unAOTed |
| 01:27 | sjl | which means protocol definitions will be loaded from the clojure sources |
| 01:28 | sjl | roughly? |
| 01:28 | xumingmingv | dnolen: just feel not good when a language I like marked *slow* |
| 01:28 | akhudek | dnolen: why was the partial pattern bad for AOT? |
| 01:28 | dnolen | xumingmingv: what languages do you use that are *fast*? |
| 01:28 | noidi | sjl, instead of AOT'ing a class _containing_ functions that need stuff in other namespaces (which then get transitively AOT'd), you AOT a class that will, at runtime, load up the impl-ns and call functions in it |
| 01:29 | noidi | sjl, at least that's my understanding |
| 01:29 | dnolen | akhudek: partial combined with instance? I think specifically. |
| 01:29 | sjl | ah |
| 01:30 | akhudek | ah, interesting. I'll remember to try to avoid that in the project I'm using a lot of AOT in |
| 01:30 | sjl | Okay I think that's my limit of JVM bullshit for the night. Time to go to bed. |
| 01:30 | xumingmingv | dnolen: I use java at work |
| 01:30 | sjl | noidi: btw "Programming Clojure" and "Clojure Programming" both have birds on the covers :P |
| 01:30 | dnolen | xumingmingv: apologies I misread what you wrote. Martin (the writer) is actually a Clojure fan, certainly some of what he's says is true - idiomatic Clojure is often slower. |
| 01:31 | noidi | sjl, argh :D |
| 01:31 | dnolen | xumingmingv: and the community hasn't been proactive about updating the Alioth benchmarks to leverage 1.3 enhancements. We've got 3 more benchmarks to go before we have the full suite competitive w/ Java (and of course Scala) |
| 01:37 | xumingmingv | dnolen: thanks for the information |
| 01:38 | dnolen | xumingmingv: http://github.com/clojure/test.benchmark |
| 01:38 | adu | hey |
| 01:39 | adu | is anyone here in the DC area? |
| 01:39 | xumingmingv | I found a stackoverflow question talking about this: http://stackoverflow.com/questions/4148382/why-does-clojure-do-worse-than-scala-in-the-alioth-benchmarks |
| 01:39 | xumingmingv | but i dont quite agree with the accepted answer |
| 01:39 | dnolen | xumingmingv: yes, old question. run test.benchmark for yourself and see. |
| 01:40 | dnolen | xumingmingv: better yet submit one of the 3 remaining benchmarks, then Alioth will be update to date and people can go back to complaining about too many parens ;) |
| 01:41 | xumingmingv | dnolen: haha |
| 01:46 | brainproxy | dnolen: in your study of prolog/datalog, did you spend any time with DES, "datalog educational system"? |
| 01:46 | brainproxy | http://www.fdi.ucm.es/profesor/fernan/des/ |
| 01:46 | dnolen | brainproxy: I've seen it but I've never played around with it. |
| 01:47 | brainproxy | okay.. seems a bit harder to find datalog "stuff" vs. prolog books, articles, etc. |
| 01:47 | dnolen | brainproxy: to be honest I don't really understand Datalog that well - in fact I'm not even aware of any good explanations of how to implement it that aren't disk oriented. |
| 01:47 | brainproxy | i see |
| 01:47 | dnolen | brainproxy: I picked Stuart Halloway's brain about this at the last Conj (I'm assuming he was working on Datomic already) and he said the same. |
| 01:48 | dnolen | brainproxy: but clearly they figured something out that works well enough for real queries as well as data structures. |
| 01:48 | brainproxy | is datomic a kind of datalog? |
| 01:48 | dnolen | brainproxy: it supports datalog style queries yes. |
| 01:48 | brainproxy | i mean that's my impression |
| 01:49 | brainproxy | I'm interested to understand the crossover between something like datomic w/ datalog style queries and a project like orientdb |
| 01:49 | brainproxy | which also has a relational query engine |
| 01:49 | akhudek | if you are interested in query compilation/datalog specifically |
| 01:49 | brainproxy | but isn't SQL to be sure |
| 01:49 | akhudek | I guess I could recommend my collegues recent book on using FOL proof systems for this |
| 01:50 | brainproxy | akhudek: link, ISBN? |
| 01:50 | akhudek | http://www.amazon.ca/Fundamentals-Physical-Design-Query-Compilation/dp/1608452786 |
| 01:50 | brainproxy | akhudek: thanks |
| 01:50 | akhudek | if you do a google search, parts are available online as part of a class material |
| 01:52 | brainproxy | akhudek: cool.. I'm still just getting my little toe wet w/ prolog, but I've saved it for future reference |
| 01:52 | akhudek | brainproxy: if you have any questions on the topic, feel free to message me |
| 01:52 | brainproxy | thanks! |
| 01:53 | akhudek | brainproxy: I'm actively working on an implementation of what is discussed in that book (in clojure no less) |
| 01:53 | gerunddev | Is there a channel specifically for core.logic? |
| 01:54 | dnolen | gerunddev: here |
| 01:54 | brainproxy | dnolen: btw, I found another prolog primer.. http://www.ida.liu.se/~ulfni/lpp/ |
| 01:54 | brainproxy | it has a much more mathematical approach |
| 01:54 | dnolen | akhudek: curious, are you actually building a in memory Datalog? |
| 01:55 | akhudek | dnolen: it's a first order logic theorem prover, all in memory |
| 01:55 | gerunddev | dnolen: Thanks. Know of any good primers on defne, defna, etc? |
| 01:55 | dnolen | brainproxy: you can avoid buying books but the Bratko one and the Sterling Shapiro one are excellent :) |
| 01:56 | dnolen | brainproxy: Bratko 4th ed now covers CLP which is just around the corner for core.logic. |
| 01:56 | brainproxy | dnolen: I defeinitely am interested in the Bratko one |
| 01:56 | dnolen | akhudek: very cool :) open source one day? |
| 01:56 | brainproxy | but a number of comments suggested it's not a good first book |
| 01:56 | brainproxy | so I started looking for a "first book" |
| 01:56 | akhudek | dnolen: that's the idea :-) |
| 01:56 | dnolen | akhudek: sweet |
| 01:57 | noidi | sjl, btw. lein has a :skip-aot option to prevent AOT compilation of :main https://github.com/technomancy/leiningen/blob/master/sample.project.clj#L97 |
| 01:57 | brainproxy | the "Art of.." is supposed to be good for that purpose, but I like reading on ipad and mac, so opted for the book from springer.com, as I could pay and download it |
| 01:57 | dnolen | brainproxy: huh, not sure why people said that. |
| 01:57 | dnolen | brainproxy: a lot of my understanding of how to actually use core.logic came from Bratko. |
| 01:57 | dnolen | brainproxy: it's actually why I added the DB functionality right way. |
| 01:57 | dnolen | brainproxy: so I could try the examples :) |
| 01:57 | noidi | sjl, I created a bug report for lein about this https://github.com/technomancy/leiningen/issues/679 |
| 01:58 | brainproxy | interesting... okay, well maybe it would be fine for me to start with, but I'll get to it; also reading a proper Java book now, rather than just absorbing through clojure interop |
| 02:00 | brainproxy | as DES is built entirely w/ prolog, i.e. it rides on top of your prolog runtime of choice, i hope to study it as well, to see how a datalog system can emerge from prolog |
| 02:03 | gerunddev | Every core.logic demo shows that you can query goals in both directions. But I can't quite figure how to share code to do that. |
| 02:03 | dnolen | gerunddev: what do you mean? |
| 02:06 | gerunddev | (run* [q] (membero q '(1 2 3))) & (run* [q] (membero 2 q)), but I'd like to be able to use the same relationship with [item coll] then pass a value for one and bind the other to an lvar. |
| 02:07 | gerunddev | I thought something like (defne [item coll] (memero item coll)), but apparently I don't grok defne. |
| 02:07 | dnolen | gerunddev: defne/a/u are just for pattern matching sugar |
| 02:08 | dnolen | gerunddev: just make a regular function. (defn my-rel [item coll] (membero item coll)) |
| 02:10 | gerunddev | dnolen: I had gotten the impression that mixing functions and their logic cousins was a bad idea… now I can't even remember where I got that idea. |
| 02:11 | dnolen | gerunddev: yeah not true, the whole point of core.logic (really miniKanren) is that the two approaches can coexist. |
| 02:12 | amalloy | btw dnolen, what do the -a/e/o suffixes mean? i've been just putting an o at the end of my relation-based function names, but it feels cargo-cult because i don't know why |
| 02:13 | Raynes | I wish I had a condo. |
| 02:13 | madsy | Can I somehow set "lein trampoline cljsbuild repl-listen" to inferior-lisp-program in emacs? |
| 02:14 | madsy | When I do I get "Wrong type argument: stringp, nil" |
| 02:14 | dnolen | amalloy: I guess o generally mean the goal is pure, inputs and outputs don't matter. |
| 02:15 | dnolen | amalloy: -a means soft cut, other branches will not be looked at (unlike conde) |
| 02:15 | Raynes | dnolen: I'll learn core.logic if you find something in refheap that could make use of it. :D |
| 02:16 | dnolen | amalloy: -u mean committed choice. not only with other branches not be looked at, all the goals after the first goal of a clause will only be run once. |
| 02:16 | dnolen | "not only will" |
| 02:16 | dnolen | Raynes: ha! kibit service? |
| 02:16 | gerunddev | dnolen: I can't even find what I read that made me think that now. |
| 02:17 | amalloy | he's surely missing some chances to use core.match to simplify his dispatch |
| 02:17 | Raynes | amalloy: There is so much I could use core.match for. |
| 02:17 | Raynes | amalloy: My problem is that I purposely avoid it because if I had it, I'd use it for everything. |
| 02:17 | dnolen | amalloy: to be more specific, conde lines looks like this: |
| 02:17 | dnolen | [(head) ... bunch of other goals ...] |
| 02:17 | Raynes | dnolen: That's a damn good idea. |
| 02:18 | Raynes | I'm honestly going to open an issue for that. |
| 02:18 | gerunddev | As a famous author once said, "Contradictions do not exist. Whenever you think you are facing a contradiction, check your premises. You will find that one of them is wrong." |
| 02:19 | dnolen | amalloy: with conda, if a head succeeds, other [...] [...] are ignored. the remaining goals of the succeeding line can succeed many times (produce many answers) |
| 02:19 | dnolen | amalloy: with condu, if a head succeeds those remaining goals can only produce one answer |
| 02:19 | Raynes | dnolen: If I wanted to get the mention of cake out of the core.logic readme, how would I go about that? Open a jira ticket? Ask you to do it for me? My CA is under a non-legal name and I haven't sent in a new one yet, so I can't just give you a patch. |
| 02:19 | Raynes | :( |
| 02:19 | amalloy | i've at least figured out how conde/conda behave (still not 100% sure about condu), but i'm wondering what the dang letters mean |
| 02:20 | dnolen | Raynes: where do I meantion cake? |
| 02:20 | Raynes | dnolen: 'Usage' |
| 02:21 | Raynes | dnolen: core.match, sorry. |
| 02:21 | Raynes | I get your core.things mixed up all the time. |
| 02:21 | dnolen | amalloy: condu can be use to implement (onceo g). conda can't. condu can guarantee that g will only produce one solution. |
| 02:22 | dnolen | Raynes: done |
| 02:22 | Raynes | Cool. |
| 02:24 | dnolen | amalloy: both are used for pruning search so should be used care - they both disable in many instances the ability to run programs "backwards". |
| 02:26 | amalloy | okay. i'll plan on continuing to have a great new usage for conda and then eventually rewrite it when i realize i was wrong |
| 02:28 | gerunddev | I'm hoping to use logic programming in a schema on read no-sql environment. |
| 02:28 | dnolen | amalloy: I believe their inclusion in miniKanren was to show they could get nearly all the functional of "real" Prolog as it's used in practice. |
| 02:28 | ssutch | if i just want to return a body as-is from an if exp, what would i do? |
| 02:28 | gerunddev | We currently have problems where document structures evolve over time, and writing migration scripts seems to defeat the purpose of using a no-sql datastore. |
| 02:29 | dnolen | amalloy: I've found them useful in making it easy to port Prolog. then it's fun to see if cuts can be eliminated w/o slowing things down too much. |
| 02:29 | ssutch | eg (if ((a) (b)) c) i want to get ((a) (b)) |
| 02:29 | gerunddev | What if you could use rules to say, can this be interpreted as something valid? |
| 02:29 | amalloy | (or) |
| 02:29 | amalloy | specifically, (or ((a) (b)) c) |
| 02:30 | ssutch | sorry, i didn't quite explain well enough |
