LispForum

Hi Ramarren,

I tried the version you linked also.

No luck with it, so I think I'll try to run it on SBCL for windows and see how I get on.

Cheers

Hello, I have been trying to load Screamer (http://www.cl-user.net/asp/ys9U/sdataQIIk8RWlCNhODQ3jQRpX8yBX8yBXnMq=/sdataQu3F$sSHnB==) in order to work with constraints in CL. However I am having trouble loading the package. I am using the free edition of allegro cl 8.2 When I first tried to compile a...

thanks a million.
that's really helpful.
i was barking up the wrong tree entirely.
i never understood that about cons when only using recursion.
thanks again!

hi, this is a very basic question. i've been trying to experiment with iterations, but cannot figure out how to return following an iteration, outside the iteration. for instance, if i want to find the list of factors for a number, i might define it recursively as follows: (defun foorec (n) (reverse...

Great thanks a million! I much appreciate that explanation. You've been very helpful. (I'm presuming it's not best style to return nil as a base case for recursions as tail-end recursion is favoured to building up and returning a stack. (That's at least what I gathered from the tutorial I looked at.))

Thank you to both of you for your help. The question I was trying to ask was why the T returns for the default NIL &key parameters were "trivial", but I did not express myself very clearly. As far as I can now see, it is simply because: (remove-if-not #'(lambda (cd) t) *db*) returns *d...

Hello all, I am new here, and also new to lisp. After a brief online tutorial I am looking at Practical Common Lisp. However I have quite quickly been presented with something that I cannot quite understand. I am referring to the query function in chapter 3 (a simple database.) I do not understand h...