LispForum

nuntius wrote:Does your editor use any *~ or #*# files for backups?

Why yes it does.

Thanks Nuntis

I had an accident and a lost a file I had loaded into SBCL from my editor .
Is it possible to retrieve the code from the still running implementation and dribble it back to a text file?

Thanks!

nuntius wrote:This link? http://www.ic.unicamp.br/~meidanis/cour ... blems.html

Yes. Sorry, should have been a little more specific.

They built steadily from one to the next right up until problem 50 (Huffman Coding).

I was wondering what others thought about these exercises. There doesn't seem to be much discussion about them. Are they worthwhile? Has anyone worked them all? I'm asking because I've reached the binary tree section and my solutions are getting really ugly. Without the solutions to learn from (they...

Finished this a couple days after my original post (way back in December), but wanted to get some input. Ruthless criticism welcome. Thanks for your time. ;;;Connect4 (setf b1 (make-array '(6 7) :initial-element nil)) ;empty board. (setf *num-connect* 4) ;number connected to win. ; up right up-right...

I'm finishing up a connect 4 project and was wondering if anyone would be willing to critique it. I don't really know how to program, so I know I'm doing some of it all wrong. Thanks.

I see. So, practically speaking, in order to really be able to use just these primitives, one would need to add SETQ, and if you wanted lexical scoping, LET. I suppose LAMBDA as well, for convenience sake. ...scheme added additional features for handling variables, like lexical scope and a single na...

So, to name a value using only these primitives I would use defun like this?

(defun x () 10)

methusala wrote: ; Assumes only quote, atom, eq, cons, car, cdr, cond.

So, this means that defun, quote, atom, eq, cons, car, cdr, and cond are the bare minimum constructs in Common Lisp?

I'm new to programming and have been reading up on fundamental programming theory. So, Turing machines are the first thing I stumble upon. I believe I understand on a very basic level the idea of a Universal Turing Machine (what it is and how it works, it's significance, etc.). I became intrigued by...