I'm currently reading the SICP, and working on Exercise 2.5 : Exercise 2.5. Show that we can represent pairs of nonnegative integers using only numbers and ari
I am trying to convert this code to lisp code. But don't know how to do it is it right? for (j=i-1; j>=0 && list[j]>key; j--) { list[j+1] = li
I have the following list: ((a b) (c d) (e f)) and want to loop through it and combine the list elements together. I also have the loop for that, which works e
I need some hits how I should go about and implement continuation for lips in JavaScript (my lisp is almost like scheme, except no continuations and TOC). Here
I don't mind admitting that this is a homework task that has me stumped. Any push in the right direction would be useful. I'm required to write a function that
Does anyone know how to install cormanlisp? I downloaded the open source project from github https://github.com/sharplispers/cormanlisp, but there is no .exe in
I think I'd have to dig into SICP later, but if it is two lists: a b c d 1 2 3 Is there a standard way to get the multiplication of them in 2, 3 or 4 lines? So
I am very beginner in LISP and hope that you can solve my confusion for me. My code is as follow: (defun retrieve (element closed) (if (= (length c
A few days ago, I learned about the eql clause of the defmethod argument specification syntax. The defmethod hyperspec makes it clear that the presence of the e
Emacs lisp is a dialect of LISP and especially Scheme. Most of scheme interpreters do have a optimization of Tail Recursion, but emacs lisp doens't. I searched
I am working using a visual programming environment for musical composition based on CL . I am trying to create a function that when given say 3 elements (1 2 3
I am working using a visual programming environment for musical composition based on CL . I am trying to create a function that when given say 3 elements (1 2 3