freenode/#lisp - IRC Chatlog
Search
2:49:55
aeth
first cl-foo, then cl-foo42 because cl-foo is stuck on version 35 and then if you need a different foo 42.x binding you're in trouble
8:16:47
ealfonso
what is the difference between (SYMBOL-VALUE (FIND-SYMBOL (SYMBOL-NAME 'MY-SYM))) and MY-SYM?
8:25:40
phoe
the lexical bindings disappear after the code is compiled, so a string would have nothing to refer to.
10:30:44
_death
Xach: since you mentioned tic-80, check out my fork https://github.com/death/TIC-80 ;)
13:14:46
TMA
It is related to vector space dimension ... n-tuples of (real) numbers make a vector space of dimension n
13:15:38
beach
Not quite. If you compare to Common Lisp arrays, then the number of dimensions is called the rank.
13:20:31
TMA
rank is a higher level concept. a matrix is has rank 2, because it is a m-tuple of n-tuples, with tensors having even higher ranks; in Common Lisp a vector is a tuple (and vice versa) and a vector has rank one regardles of the dimension thereof
13:22:38
_berke_
hi guys, I get a "This is probably a bug in SBCL itself." from maxima under imaxima, see https://pastebin.com/p7n7BSa2 - any tips?
13:27:12
pfdietz
If errors are not caught in SBCL, a stack trace gets printed showing where the error was signalled.
13:28:06
pfdietz
The other thing to do is find the function it could not compile and prune off as much of it as you can while still getting the error. Put a copy of it into its own file and edit that down.
13:28:25
_berke_
I setf'd *debugger-hook* to nil, now I'm in the debugger. can I request a bt from there?
13:29:46
pfdietz
Then submit a bug at https://launchpad.net/sbcl or send it to sbcl-bugs@lists.sourceforge.net
13:30:17
_berke_
thanks, the thing is when I run maxima from the shell (ie not under imaxima from emacs) it works fine.
13:31:20
pfdietz
Not sure why you're not getting the stack track. Try aborting to the top level REPL and manually loading that file with (load "/usr/local/share/maxima/5.41.0/share/pdiff/pdiff.lisp")
13:33:48
pfdietz
If you put that function in its own file, be sure to include a (in-package ...) form so it's read in the correct package.
13:35:06
pfdietz
I assume this is the official source: https://sourceforge.net/p/maxima/code/ci/master/tree/INSTALL
13:39:44
_berke_
is cat foo.lisp bar.lisp >baz.lisp and then (load "baz.lisp") equivalent to (load "foo.lisp") (load "bar.lisp") ?
13:40:33
jmercouris
also you generally want to avoid manually loading lisp files, instead you should use a system
13:40:52
jmercouris
so the de-facto system is "ASDF" which stands for "another system definition facility"
13:40:54
_berke_
jmercouris: I understand but I'm chasing a bug that involves two files, is there a way to place them in a single file for an easier-to-use bug case?
13:41:33
jmercouris
_berke_: it will not be the same thing, but you might try what you are suggesting, and the bug might still appear
13:41:41
Bike
that's a pretty primitive way to do things, but i don't see why the concatenated file would be much different
13:45:06
_berke_
I hope so. how can I check if any native code (e.g. shared libraries compiled from unsafe languages) were loaded?
13:48:11
pjb
ukari: "AS" is the name of a package (probably a short nickname actually). quickload loads systems. It expects a system name, not a package name.
13:49:38
pjb
ukari: also, not all systems are on quicklisp, and not all packages are defined in systems.
13:51:36
pjb
ukari: so you have 1- locate the name of the system where this package is defined. Then you may try quickload on it. If it doesn't work: 2- locate the source of that system (perhaps a git repository, perhaps a tarball somewhere). Then you can clone it or untar it in ~/quicklisp/local-projects/ and try quickload again. If not a system, then locate the sources, download them, and either use a load script provided to compile and lo
13:52:01
pjb
Be sure to contribute the asd system if you write it, so it may eventually be integrated in quicklisp.
13:55:41
_berke_
it seems to be the combination of that style-warning-suppressor macro and the memq definition
13:56:57
_berke_
transcript: https://pastebin.com/92cSATWH - thanks for your help, gotta earn some money now
14:17:34
light2yellow
I was reading LISP 1.5 manual, appendix H ( https://books.google.com/books?id=68j6lEJjMQwC&pg=PA91 ) talks about recursion implementation. is this the first occurrence of a programming language implementing recursive functions? from what I can understand, it doesn't differ much from call stacks we have now