freenode/#lisp - IRC Chatlog
Search
9:51:15
MichaelRaskin
To be honest, I think that the AI directions for Lisp machines are not what the modern AI boom is
9:52:18
beach
blep-on-external: How is that related to Common Lisp? Most modern Common Lisp implementation compile to native code, using the registers of the processor.
9:52:59
beach
blep-on-external: And there is no such thing as "interpreted language". Whether a compiler or an interpreter is used is related to the implementation, not the language.
9:55:44
blep-on-external
a lot of interpreting implementations for languages use stack based VMs. these are simple to compile for cause there's no register trickery needed
9:56:05
blep-on-external
instead of "put 2 in register #1, put 3 in register #2 and add #2 into #1", a stack VM runs "put 2, put 3, add them"
9:57:34
phoe
blep-on-external: if this is what you mean: yes, in theory you can create hardware that is highly optimized for CL
9:58:01
blep-on-external
i'd like an OpenCL version though that automagically converts vectors to OCL arrays and back
9:58:06
phoe
in practice: you'll need a person who'll have enough money, time and people to do it, and it is highly unlikely such a person exists
9:59:36
pjb
The current hardware is highly optimized for lisp, just like for C or any other programming language. Let's say it's a good local optimum.
10:00:06
pjb
It's the fact that you coded the kernel in C, and you have to interface to it and to a lot of userspace libraries written in C.
10:00:33
MichaelRaskin
Per-language hardware optimisation might make sense if there is an actual niche where «twice as fast» is more expensive per-chip than «half as many»
10:01:04
blep-on-external
the machine doesn't have a "symbol" type, "integer" type, "pointer" type or anything
10:01:14
pjb
The solution is to use a kernel written in lisp. cf. Mezzano, Movitz, etc, or participate into beach lisp OS project (planning stage now).
10:05:50
JuanDaugherty
the music on that video about common lisp made it sound like all those people were dead
10:09:40
JuanDaugherty
i have a lisp OS windmill but in my thing, lisp is just a high level thing, a controlling image over a more or less standard linux
10:10:43
blep-on-external
i have a portable lisp interpreter kernel thingamabob which runs on Linux, C64 and DOS
10:13:11
pjb
You mean the sicp lectures? https://www.youtube.com/watch?v=2Op3QLzMgSY&list=PL8FE88AA54363BC46
10:15:02
JuanDaugherty
sorry, thought it was one you posted, dunno where but it was obviously in last hour or so in some freenode channel
10:15:03
pjb
It was 30 years, they were in their 30s, so they're all retired now. Berlin wall wasn't down yet!
10:16:53
MichaelRaskin
JuanDaugherty: is your windmill a pure windmill or are there any ideas I have a chance to grab for my layered system with Lisp for high-level control?
10:19:01
JuanDaugherty
i am refactoring, leveraging off of existing code, one CLOS app which shall remain nameless in particular
10:20:28
MichaelRaskin
I currently use Lisp to do the root-level control, and then I have some integration with StumpWM and I definitely embrace having multiple Lisp instances with different lifetimes and different OS privileges
10:21:30
MichaelRaskin
So if you are refactoring some preexisting CLOS application, maybe we have started from complementary directions anyway
10:22:25
JuanDaugherty
well the core of my OS concept is to make a single system image using 9P stuffs
10:24:01
MichaelRaskin
In my case it would probably go from the other direction: if I use OS-provided jails and multiple interacting processes for everything, is there that much difference that some of them are not even local…
10:25:46
JuanDaugherty
first expressing an idea in a publicly logged channel is a kinda virtual NNDA
10:28:21
JuanDaugherty
since I'm mostly refactoring and integrating it's not as quixotic as it might sound. I will make code available in my git repo to authenticated users of my domains
10:32:16
JuanDaugherty
pjb, what percent of those people at the X3J13 meeting would say are in fact retired?
12:19:44
pjb
JuanDaugherty: well, they look like they're between 27-35 so most of them would be today between 57 and 65. Furthermore, they're all american or live and work in the US, so retirement is more flexible, so I would say that none of them are retired yet. A few of them are already dead. Others are still working. Perhaps 30% are planing to retire in a couple of years, and the rest later. Now of course, you could use google and wiki
12:19:44
pjb
to get more information about the group, their age, and the current status. It would be more interesting to write an AI to do it for you. You could try wolfgan alpha on it perhaps?
12:38:27
scymtym_
phoe: you asked about let-plus. i did some maintenance work under the sharplispers organization. the improvements should be in quicklisp
12:41:45
makomo
pjb: it would be interesting to find the full list. i've recognized 3 people so far -- steele, kiczales and pitman
12:47:13
beach
makomo: Very impressive! From where do you recognize them? Of the three, I have only met Pitman, but I am not sure I would recognize him in the video.
12:49:35
makomo
beach: the internet, i've yet to meet another lisper in real life :-). both kiczales and pitman have a picture on their sites
13:10:33
JuanDaugherty
no doubt the thing is coming, prolly available to some extent and even google does pretty well if you have super chops for it
13:23:07
p_l
MichaelRaskin: one thing you need to take into account is that processes being remote *does* matter - you get to deal with network that might be much less perfect that intra-computer IPC
13:28:15
MichaelRaskin
p_l: depends on how remote. And I build everything around «experiment anyway, it's no problem if something crashes», which means that local IPC is also slowly adjusting the expectations
13:41:15
Xof
user-defined method combinations, with :generic-function, possibly (particularly when used with user-defined generic function classes)
13:42:36
pjb
JuanDaugherty: for example, if you say that the sum of the angles of a triangle is π radian, then you're wrong. On Earth, it's greater, in general. Locally it can be smaller.
13:43:38
pjb
You would have to quote your axioms and your inference rules with all your sentences, to be able to say true tautologies.
13:44:37
pjb
Bookmarked https://www.youtube.com/channel/UChkEqt6l4gwfoyJPPS7OTiA/videos ; I'll watch it later.
13:54:01
Xach
phoe: http://report.quicklisp.org/2018-04-28/failure-report/gamebox-math.html#gamebox-math
14:39:00
makomo
a very interesting video: "Why Black Boxes are so Hard to Reuse, lecture by Gregor Kiczales", https://www.youtube.com/watch?v=5l2wMgm7ZOk
14:41:38
pfdietz_
Xof: it used long form define-method-combination, but not :arguments or :generic-function. Although looking at those, I could see them being useful in my specific case.
14:50:34
phoe
Is it wise to (defmacro bar ...) (setf (macro-function 'foo) (macro-function 'bar)) to have the same macro definition under two distinct names?
14:51:25
phoe
" The consequences are undefined if environment is non-nil in a use of setf of macro-function."
15:15:22
pfdietz_
The method combination is called randomized. It invokes a random applicable method. The methods have weights that control their relative likelihoods.
15:27:03
pfdietz_
If I want a method to be able to fail and reinvoke the generic function, that would be a use case for the :generic-function argument (as I understand how that works).
15:28:13
pfdietz_
Yes. Or if I wanted to have some control over the random number generator, there could be extra arguments to do that.
15:33:27
Xof
hey, pfdietz, that's a "fun" ansi test: check that defining a method combination with a :arguments &key foo clause doesn't cause that keyword to be accepted by the generic function
15:33:51
Bike
i was going to say you could expand into (tagbody top ...however you choose... (call-method method (make-method (go top)))) to do "failure" by call-next-method, but the make-method form is evaluated in a null lexical environment
15:36:05
pfdietz_
The methods always know the name of their generic function, so unless the failing is occuring in the method combination's glue code that use isn't a very good one.
15:38:29
Xof
I wanted to implement a finite state machine method combination, using qualifiers as state labels
15:39:13
Xof
but again it's not quite right, because the qualifiers are for compile-effective-method-time and the methods' return values are effective-method-run-time
15:40:01
Xof
so far the most promising use of :arguments (for me) is information to affect the combination passed as an extra keyword argument
15:40:54
pfdietz_
Method combination for constraint satisfaction, where each superclass is a different kind of constraint.
15:59:25
Bike
pfdietz_, Xof: https://gist.github.com/Bike/5ca14ba142f3ca3fc65e4c912f4cde9f now if you'll excuse me i need to escape my volcano lair before it erupts
16:00:21
pfdietz_
Method combination for implementing simulated annealing, where temperature is an argument.
16:00:49
pfdietz_
Method combination for executing methods in separate threads, where max # of threads is an argument.
16:07:28
wooden_
i'm doing ncurses development, so running sbcl in another window and slime-connect'ing to it. i would like to use log4cl, but in addition to printing in the slime repl, it prints to the sbcl window as well, messing up the ncurses display. can i disable output to the sbcl repl? if so, how?
16:10:29
scymtym_
wooden_: (log4cl:remove-all-appenders log4cl:*root-logger*) (log:config :stream SLIME-STANDARD-OUTPUT) where SLIME-STANDARD-OUTPUT is just *standard-output* if you execute the forms in the SLIME repl
16:14:45
Bike
i forgot you can't have multiple methods in the same group if they have the same level of specialization, which makes the whole exercise even mroe pointless than it was already
16:43:59
orestarod
my question regards cl-yacc and I want a clarification regarding whether it is possible to state precedence for prefix operands in my grammar
16:49:23
scymtym_
orestarod: not sure if this is what you need, but for infix operators in esrap grammars, maybe have a look at https://github.com/scymtym/parser.common-rules/#infix-operators . it can handle some common cases
16:54:01
orestarod
scymtym_: I would need to rewrite my grammar in your parser. If I see no light from cl-yacc, I will switch to your work and maybe consult you after reading the docs. Thank you nonetheless! :)
16:55:30
Bike
eight lines to cover basic arithmetic seems a lot more convenient than yacc, though maybe it's hard to do in addition to non-expressions or something
16:56:50
orestarod
What I am trying to do is more complex than simple arithmetics,though not too complex. I will provide the grammar if you wish to check for yourself and maybe tell me a few tips.
16:56:57
Bike
minion: message for scymtym: in the parser.common-rules readme, the link to architecture.builder-protocol in the "infix operators" section is a little messed up.
16:56:58
minion
message for scymtym in the parser.common-rules readme, the link to architecture.builder-protocol in the "infix operators" section is a little messed up: An error was encountered in lookup: Parse error:URI "http://www.cliki.net/message%20for%20scymtym%20in%20the%20parser.common-rules%20readme%2C%20the%20link%20to%20architecture.builder-protocol%20in%20the%20\"infix%20operators\"%20section%20is%20a%20little%20messed%20up?source" contains illegal character #\" a
16:57:35
orestarod
THe problem is the grammar is inherently ambiguous, and needs proper operand precedence to solve that
18:12:53
mfiano
Oh, nevermind. I thought you were the maintainer of McCLIM. Sigh, I am getting really confused lately.
18:31:26
mfiano
Likewise, but moreso that something like this could be created in a such a short period.
18:34:51
phoe
People can prepare their libraries in advance, but they start coding at a given hour of a given day and they must finish coding before a given hour of another day.
18:36:14
mfiano
jackdaniel: Thanks for the excellent work in McCLIM if I never thanked you (and all the other contributers too).
18:39:53
mfiano
Some months ago I saw that my pngload library was forked in preparation for the mezzano port, and I'd like to know if that ever got anywhere
18:40:34
jackdaniel
well, as far as I know it works just fine on mezzano, I think he needs to tie some loose ends here and there and it will be merged upstream
18:41:02
jackdaniel
he was a little blocked by me, because I was refactoring mirror class hierarchy until two weeks ago
18:43:10
mfiano
After the jam deadline (tonight/tomorrow depending where you live), everyone will have 4 days to play and then rate their favorites, so stop by again then :)
18:44:46
jackdaniel
but that will have to wait until I'm done with things (now I'm hacking on ECL and I'm learning Forth)
19:12:38
phoe
flip214: https://github.com/phoe/protest/blob/master/src/1am/1am.lisp that's my integration code
19:14:17
flip214
phoe: but neither quickdocs nor quicklisp:system-apropos nor a listing of my ~/quicklisp/.../software found any matching system name!
19:21:15
phoe
jackdaniel: I promise you that the next testing framework I create will be called HALF-PAST-TWO
19:21:25
flip214
phoe: I looked for "4", "5", and "6", each "pm" and "am", but couldn't find anything.
19:22:33
phoe
jackdaniel: thanks for the heads-up, I'll think of integrating it with PROTEST based on my 1AM code
19:23:40
jackdaniel
do whatever you please. I'm not planning to put it on quicklisp, I'm already confused with unit test frameworks we have, not going to make the problem bigger
19:44:43
Xof
Bike: that (:method-combination machine) looks surprisingly sane. Doesn't use arguments or generic-function, though :-)
19:49:59
Bike
so really we'd like to have an infinite number of metnod groups. define method combination is not powerful enough, obvs
20:02:48
Xof
but you can make your machine method combination work with sbcl by making :start a method-combination argument
20:39:52
Petit_Dejeuner
Anyone want to reccomend a testing framework? I was just going to use lisp-unit or maybe 5am, but my reccomendations are 11 years old now.
20:41:37
jackdaniel
as of other gazzilion unit testing frameworks – can't tell. 1am is good for running tests by hand and stress tests