Search
Thursday, 31st of May 2018, 1:35:18 UTC
2:08:25
fiddlerwoaroof
skeuomorf: you have to have the git version of slime for that error
2:08:51
fiddlerwoaroof
Are you using emacs 26? some of emacs's apis changed and the relevant slime changes are not released yet.
2:59:46
beach
Good morning everyone!
3:01:17
Fare
are you in France? It's very early there!
3:02:07
beach
Waking up early is a genetic defect in my family.
4:48:03
epony
I would consider it a lucky gene.
4:53:34
epony
And, most wonderful sunrises these days here too with a full moon on the opposite side of the sky at the same time..
4:54:38
White_Flame
sunrise is best experienced before finally going to sleep
4:54:42
epony
Plus, lime tree blossom nightly scent..
4:54:56
White_Flame
the sign of a productive night
6:39:37
Lord_Nightmare2
** NICK Lord_Nightmare
6:49:42
merskiasa
Anyone here able to write an IRC bot like this: http://www.omnimaga.org/computer-projects-and-ideas/haroldbot-%28theorem-prover-solver%29
6:52:04
Lord_Nightmare2
** NICK Lord_Nightmare
6:55:11
beach
merskiasa: Are you planning to offer such a person some money?
6:55:47
merskiasa
The thing has four modes: 1) solve, 2) quantified solve, 3) calculation and 4) prove.
6:56:10
merskiasa
1) solve and 4) prove are basically identical, because they differ only in predicate to prove (equality for solve and arbitrary comparison for prove). Prove needs a way to interpret results
6:56:35
merskiasa
I know how to formulate problem in CNF/BDD form. I also know how to use SAT solver. I haven't implemented interpretation of unsatisfability results.
6:56:53
merskiasa
beach, you interested in the project?
7:29:35
merskiasa
Anyone want to work on the project with me?
7:32:26
beach
merskiasa: It's a bit far from the interests of most #lisp participants.
7:37:05
merskiasa
shka_, How so? What would you like to know?
7:52:05
Lord_Nightmare2
** NICK Lord_Nightmare
7:57:19
Lord_Nightmare2
** NICK Lord_Nightmare
8:06:06
Lord_Nightmare2
** NICK Lord_Nightmare
8:17:52
beach
merskiasa: I suspect shka_ would not be interested anyway, but I might be wrong.
8:19:24
shka_
beach: busy with my own stuff, but merskiasa didn't even said what the heck he is doing
9:00:04
addsub
greets, I can't find lisp games channel
9:00:15
addsub
anybody happen to know whereis at.
9:01:01
White_Flame
it's hidden in the cryptically named #lispgames
9:01:30
xificurC
White_Flame: a good lisper writes lisp-games
9:02:56
p_l
an old lisper writes lspgms
9:03:36
White_Flame
and older lisper writes LISP games
9:04:02
p_l
no, no, you see, the symbol had to fit in 36bits, so case is irrelevant but only 6 letters ;)
9:04:21
p_l
how do you think RPLACA happened? :D
9:06:24
TMA
it is for similar reasons the unix syscall is called creat
9:06:50
p_l
it's definitely the reason for Pascal function names
9:07:03
p_l
(and case insensitivity - 60bit symbols in Pascals case)
9:08:36
shrdlu68
TMA: Apparently they had a choice on that one: https://en.wikiquote.org/wiki/Ken_Thompson
9:11:03
merskiasa
Is anyone interested in helping me with my project?
9:12:46
skeuomorf
bah, who else uses coleslaw?
9:13:26
shka_
merskiasa: you didn't even said what your project is you blockhead
9:13:50
beach
shka_: Actually, merskiasa provided a link.
9:14:40
merskiasa
<merskiasa> Anyone here able to write an IRC bot like this: http://www.omnimaga.org/computer-projects-and-ideas/haroldbot-%28theorem-prover-solver%29
9:14:48
merskiasa
<merskiasa> The thing has four modes: 1) solve, 2) quantified solve, 3) calculation and 4) prove.
9:14:49
merskiasa
<merskiasa> 1) solve and 4) prove are basically identical, because they differ only in predicate to prove (equality for solve and arbitrary comparison for prove). Prove needs a way to interpret results
9:14:49
merskiasa
<merskiasa> I know how to formulate problem in CNF/BDD form. I also know how to use SAT solver. I haven't implemented interpretation of unsatisfability results.
9:15:05
merskiasa
http://haroldbot.nl/how.html
9:18:34
Lord_Nightmare2
** NICK Lord_Nightmare
9:18:56
beach
shka_: Did you wake up on the wrong side of the bed this morning?
9:20:17
shka_
i have a bit of personal issues at the moment
9:20:43
shka_
no worries, i shouldn't be a asshole for sure
9:21:07
shrdlu68
Sounds interesting, but a little too involved to just casually waddle into for me.
9:22:02
shka_
merskiasa: maybe you can simplify the problem by using prolog?
9:23:06
shka_
sorry, i need to restart my machine
9:28:17
Lord_Nightmare2
** NICK Lord_Nightmare
9:40:47
merskiasa
shka_, That could be possible, how exactly?
9:40:58
merskiasa
What were you thinking
9:41:07
shka_
well, you can use paip prolog
9:41:15
shka_
there is one in quicklisp already
9:42:05
shka_
it is rather messy and if i would have more time i would write my own (with thread safety and perhaps even parallel unification built in) but it should be enough for you
9:47:40
shka_
i have issue with (locally (defclass
9:48:23
shka_
namely: defmethods complain about class not existing
9:49:22
shka_
i think i know what may be wrong
9:49:43
beach
Why would you want to wrap DEFCLASS in LOCALLY?
9:50:51
shka_
beach: to add (declare (optimize (safety 3)))
9:51:23
shka_
well, i have no idea what is going on here
9:51:52
shka_
if i compile defclass forms independly it works
9:52:11
shka_
but when loading asdf, it starts to be problematic
9:52:52
shka_
it is almost like locally forms are skipped, and loaded at the end
9:53:52
shka_
beach: maybe i should simply declaim instead?
9:54:35
beach
It ought to work, I think. What are the symptoms of the problem?
9:55:11
shka_
well, i have file with few locally defclass and few methods (initialize-instance)
9:56:21
shka_
when i attempt to load with quicklisp (which just calls asdf i think) it won't load because of unkown class
9:56:28
shka_
but when i load file on my own, it just works
9:56:31
beach
Yes, I think that's correct.
9:56:54
beach
The body of LOCALLY is not treated as top-level forms.
9:57:35
beach
Nope, sorry, I was wrong.
9:58:07
lieven
yeah the last sentence of LOCALLY says: If a locally form is a top level form, the body forms are also processed as top level forms.
9:58:17
beach
Indeed. Just checked.
9:58:23
beach
Now, what about DEFCLASS.
9:58:29
shka_
i wonder what about (let () instead
9:58:44
beach
That's definitely not going to be top-level then.
9:59:09
specbot
Couldn't find anything for defclass..
9:59:13
specbot
http://www.lispworks.com/reference/HyperSpec/Body/m_defcla.htm
10:00:27
beach
You are not trying to instantiate the class at compile time, are you?
10:00:30
lieven
defclass is used as an example in the ISSUE about locally and I see no reason why it shouldn't work
10:00:50
lieven
also 3.2.3.1.1 mentions it
10:02:27
shka_
beach: actually i do, but it looks like separate problem
10:03:11
shka_
added eval-always and it works?
10:04:23
shka_
maybe i misread error message
10:17:51
theemacsshibe[m]
Phone messed up. Hi.
10:20:10
shka_
beach: fixed, i wanted to clever and extracted list of slots during macroexpand
10:23:28
p_l
hmm, is there a list somewhere of what is included in Allegro Free Edition and what isn't?
10:25:38
beach
shka_: Yeah, that is problematic.
10:26:24
shka_
but i will have to give accessors manually
Thursday, 31st of May 2018, 13:35:18 UTC