freenode/lisp - IRC Chatlog
Search
0:18:28
pillton
jasom: Specialization-store can inline calls to "methods" if there is sufficient type information available.
0:19:59
pillton
jasom: https://github.com/markcox80/specialization-store/wiki/Tutorial-3:-Compile-Time-Support
1:27:57
jasom
anyone know if cl-sqlite is still being developed, and if so, where to report bugs? The mailing-list link on the webpage is broken...
2:53:06
myrkraverk
My very first asdf system has a name conflict whenever I re-compile it, when I load it with (ql:quickload) however, on subsequent loads, it succeeds.
2:54:23
myrkraverk
That is, I have a name conflict in :common-lisp-user and :my-package when I load it with (ql:quickload :my-package) and it needs to compile source file again.
3:34:56
Fare
asarch, he hasn't been in #lisp in many years. Not sure he uses it much if at all these days.
4:08:29
asarch
A book that you can use as a reference manual (how to open files, how to list directories, etc)
4:09:35
aeth
PCL is more of an introduction. Common Lisp Recipes (same publisher, different author) is more of a reference. I don't think it's online. The ebook was on sale for $10 on Black Friday. So... you'd have to wait almost a year
4:16:50
aeth
The core language features of Common Lisp haven't been changed in over two decades. The language extensions are a mix between just as old as the language (things that didn't get in the standard, but could have) and fairly new things. They still move fairly slowly. But everything else is just like any other programming language, and it changes over time.
4:50:09
pierpa
The best reference manual for CL is CLTLII + checking CLHS to be sure particular things haven't changed.
6:04:52
asarch
One stupid question: I start sblc and then type a few expressions, is it possible to save them into a file?
6:19:12
myrkraverk
For example I have it configured with :history #p"~/.sbcl.history" ; in my .sbclrc
7:17:17
smokeink
Is there any easy/idiomatic way to find all symbols that are fbound to some function ?
7:29:19
loke
Does anyone know of a nice library that can parse infix expressions as strings and evaluate them?
7:32:12
myrkraverk
It's basically the tutorial in most compiler books, but I don't know about a library for it.
7:33:28
myrkraverk
As in, flag1 flag2 flag3 are meant to be mutually exclusive and so far, each is a simple parameter.
7:33:48
myrkraverk
For two, I can just use (and flag1 flag2) but it gets harder when there are 3 or more.
7:35:19
myrkraverk
Of course there's something simple to do it. I was thinking about rolling my own with LOOP.
7:35:56
loke
If you have lots of flags, LOOP witll be more efficient as it will allow you to exit early.
10:19:18
specbot
Processing of Top Level Forms: http://www.lispworks.com/reference/HyperSpec/Body/03_bca.htm
11:22:22
jmercouris
every letter is a symbol, and together they compose words which are also symbols which ultimately express something
11:36:03
pjb
jmercouris: I would argue the symbolic expression is more precise, by being more fuzzy on the actual ranges of frequency, and also, ontologically, since an actual perceived color (light frequency) can be different from the actual color of the surface, under light conditions.
11:36:44
Zhivago
It's not a very interesting grammar -- just one composed of atoms and forms, where a form is a list of atoms or forms.
11:38:30
jackdaniel
my point is exactly that – are shorthands for forms also considered s-expressions?
11:39:25
pjb
jackdaniel: now you always have the ambiguity between the textual form and the read form. But formally you can accept the textual form under those definitions.
11:40:55
Zhivago
Fortunately, reader macros aren't part of the definition of symbolic expressions, so we can exclude those.
11:42:45
pjb
the usual definition of sexp := atom | ( sexp… ) . wouldn't take into account circular structures.
11:43:46
kolb
the current onslaught of "let me document all your projects using my $docgenerator" has to stop -.-
11:44:50
kolb
No I have two zombie sites that *mis*-render the polished docs of my projects without me ever having opted in to that, and seemlingly no way to make them *stop*.
11:44:59
Zhivago
Just go back to the Recursive Functions of Symbolic Expressions and their Computation by Machine paper. :)
11:45:54
kolb
quickdocs and quickref are imho the CL equivalent of yellow-pages sites that come up when you google for something. It’s *never* the site you are looking for. They are content mills.
11:47:39
kolb
Zhivago: to whom? quickdocs is unmaintained and just a ghost ship floating the S3, quickref probably has way other priorities than me and my polished docs, and was done in an internship
11:48:33
kolb
There is no editor, that’s the whole point. These projects just blindly scrape quicklisp and dump the result on the net.
11:51:57
Zhivago
kolb: Do you want to do a better job, or just not see those results in google searches?
11:52:28
Fare
kolb: I'm sure Didier Verna, who oversaw quickref, will be glad to accommodate your requests for an API to customize how quickref extracts documentation for you.
11:55:23
kolb
Zhivago: I want the announcement of $docportal to include a reasoning of 1) why its supposed to supersede existing broken $docportal, 2) how they deal with the natural issue that there is no defined grammar for docstrings, 3) document a way to opt-in/out (the "I scrape facebook and host profiles" model is not new, and neither are the issues with it)