freenode/#lisp - IRC Chatlog
Search
7:22:14
jackdaniel
hscl reminds me boringcc principles: https://groups.google.com/forum/m/#!msg/boring-crypto/48qa1kWignU/o8GGp2K1DAAJ
7:22:59
jackdaniel
another approach, which is fully standard compatible would be signalling conditions whenever programmer tries to depend on undefined / underspecified mechanism
7:25:39
beach
But yes, if there is no reasonable action to take, then signaling an error is an option.
7:46:21
azrazalea
This is what I ended up with https://gitlab.com/azrazalea/azrazalea-net/blob/master/functions.lisp
7:46:32
azrazalea
With the addition of https://gitlab.com/azrazalea/coleslaw/commit/577053276c87833bd2419e9928d5924b6c655a68 to coleslaw
8:19:58
jack_rabbit
How do common lisps deal with infinitely recursive macro expansions? They obviously can't fully expand them at compile-time.
8:22:09
jack_rabbit
but doing further expansion at runtime inside a compiled function seems like it would require modifying a compiled function on the fly.
8:27:07
jack_rabbit
aha. okay, so when I enter that and evaluate (foo (1)) at the repl, it works. Trying to compile a file with it fails with blown stack, as I would have expected.
8:28:51
jack_rabbit
I was just surprised it worked in the repl. Guess it doesn't do full expansion when it's interpreting.
8:32:54
edgar-rft
jack_rabbit: an infinite stack is an inevitable requirement for infinite recursion, infinite compile-time will be next ... :-)
8:36:29
jack_rabbit
I know it can't *actually* recur infinitely, but if you expand only as necessary you can still evaluate a form.
8:43:09
edgar-rft
If your macro non-recursively expands into a recursive helper-function or a LABELS form you can implement run-time checks for the recursion depth.
13:57:32
prole
My distro repositorie purpose a version of slime, slime-2.15, but it don't work either, with the error saying that I need make operation, and just stopping on a file
14:01:46
prole
That's crazy how the help is good here. I truly don't understand why people are saying that the lisp community is bad; I only met very good and helpful people here
14:03:08
beach
prole: Yes, if you have reasonable questions, you follow the advice you get, and you learn between two questions, then usually the answers are to the point.
15:04:21
wes
And I came to a footnote that explains that 'let is a macro to rebind its variables using a lambda expression
15:05:46
|3b|
it is a special form in CL rather than a macro (though it could have been defined as a macro)
15:08:27
jackdaniel
if you type defun in it, you'll see /cl/defun and it will tell you, that defun is a macro
18:56:54
drmeister
Hi - I added some specialized vector/array types to Clasp and I thought I did everything right - but the new types/classes aren't working properly wrt subtypep
19:00:12
drmeister
I make a vector of '(integer 0 255) and the (subtypep (class-of <vec>) 'vector) -> T Great
19:01:49
drmeister
(class-of <vec-in-clasp>) -> #<BUILT-IN-CLASS SIMPLE-VECTOR-BYTE8-T> Where ECL returns #<The BUILT-IN-CLASS VECTOR>
19:02:52
drmeister
Clasp implements the specialized vectors as C++ classes - so there are a bunch of them for signed and unsigned integers and integers of 8, 16, 32, 64 bits.
19:05:19
drmeister
If anyone has pointers on how to get Clasp's subclassp to respond properly - I'm all ears.
19:05:40
drmeister
I will continue to dig into the subtypep code to figure out where the crucial test is.
19:07:52
drmeister
Well, one reason I was having trouble was cacheing of the subtypep result- I figured out how to disable it.
19:13:21
axion
While I don't have a solution, I'd just like to thank you for your determination with Clasp over the years. I have not tried it yet, but it is a project on my radar.