freenode/lisp - IRC Chatlog
Search
20:29:09
burtons
Seems to be a low level problem with promises, with everything installed out of the lastest quicklisp.
21:17:58
k-stz
http://stackoverflow.com/questions/42426046/stopped-process-but-heap-is-still-changing if someone whats to guess with me. But it's only Lisp related to the extend that I'm building a Lisp program around it
21:25:46
TruePika
k-stz: ptrace(2) acts on threads, not entire processes; the second argument is the thread ID
21:28:08
k-stz
TruePika: ah thank you, that was me using pseudo code, I got the order right in the binding
21:36:42
k-stz
multiple threads sharing the same heap.. stopping one thread would still allow other threads to change it
21:39:50
k-stz
I'm checking if the heaps overlap and then I'm gonna stop them all.. this makes sense
21:46:23
k-stz
TruePika: well first of all thanks! SIGTSTP works, but now i have some more reading to do :)
22:16:45
lagagain
Why I have different result between with sbcl and with ecl? https://www.irccloud.com/pastebin/W4BJfqRc/Common%20Lisp%20-%20Hello%20World
22:18:09
lagagain
I think "Please Input your name" is show before input name, but sbcl, abcl is after input; clisp, ecl just I think.
22:19:56
scymtym
lagagain: the implementation is free to not write anything to your terminal before the READ-LINE call. add (finish-output) to force the output
22:25:08
TruePika
but that (DECLARE (IGNORABLE C D D E F)) should theoretically suppress the STYLE-WARNING issued
22:26:19
TruePika
yup, not unique to NST: (let* ((a 1) (b 2) (b 3)) (declare (ignorable a b b)) a) results in a STYLE-WARNING about defined and unused B
22:29:38
TruePika
I can't be sure if this is an SBCL bug, I don't see anything covering this in the hyperspec
22:34:45
TMA
TruePika: if LET* is expanded in the straightforward manner to a series of nested LETs, the declare remains in the innermost LET form
22:36:57
TMA
TruePika: therefore the ignorable is the second one, not the first one, which gets shadowed before being declared ignorable
22:39:32
TMA
TruePika: not without splitting the let* into (let* ((a 1) (b 2)) (declare (ignorable b)) (let* ((b 3)) (declare (ignorable a b b)) a))
1:53:49
krwq
hey, is there any way to make cffi-grovel fix include files? im seeing it is passing wrong paths to the compiler (they are missing c: on windows)
7:03:36
athan
I think i understand the notion of prefix operation (I can't remember the correct term) - but like `+ 1 2 == 3` etc
7:04:04
athan
I'm familiar with TemplateHaskell, but I don't think that is the same concept as lisp quoting... right?
7:04:34
halogenandtoast
athan: the best way to think about it, is that at run time you basically have full control over your AST
7:05:20
Bike
it's really pretty simple. (+ 1 2) evaluates to 3. '(+ 1 2) evaluates to a (linked) list of three elements.
7:05:25
beach
athan: Code as data will make sense once you start appreciating macros as a way of extending the syntax of the language, or a way of programming the compiler to understand new syntactic constructs.