libera/commonlisp - IRC Chatlog
Search
17:11:26
_death
the question is, I guess, from this implementational model, how do we abstract to create good wording for the language specification
17:13:01
_death
in ordinary CL conversation we say that (defvar *x*), without prior reference to *x*, marks *x* as a special variable, and that this special variable is unbound
17:39:14
White_Flame
looking at the disassembly, it's only checking the low byte tags for #x09. I wonder what the rest of the word implies
17:41:08
White_Flame
(and obviously the #x50100109 is not a "value" in the lisp sense, but rather a specific machine word encoding here)
17:46:28
Nilby
Yes. Not very important to know, but at least now I can see that unbound things might look like dark red when I scroll through memory as pixels.
20:36:07
Michal
Does anybody have any recommendations for machine learning libraries in Common Lisp?
20:44:03
Qwnavery
It's a hard one because I'm unaware of any ML projects that have GPU accellerated support
20:46:28
Michal
I thought it was much faster than Python, but I heard Python had an optimised library via numphy
20:46:55
Michal
What's CUDA? I'm very new to all of this. I just finished Andrew Ngs course and wanted to try stuff out
20:53:00
Qwnavery
Michal: cool, to get started with CUDA you'll need the Proprietary Nvidia CUDA drivers https://developer.nvidia.com/cuda-downloads
2:34:43
sukaeto
late to the conversations, but I (think I) understand what beach is saying re: binding
2:36:03
sukaeto
they sometimes use it the way a compiler writer would - as in "this variable is bound to this value"
2:36:28
sukaeto
they also use it in the logical sense - as in "this variable is not free in this form. It is bound."
2:39:20
sukaeto
in the second sense, you're saying the variable is bound by the *context*. (progv '(*x*) () (boundp '*x*)) <- *x* is bound in the sense that it won't be susceptible to variable capture, no matter where that progv is put