newlispfanclub.alh.net

Okay so all I have to do is evaluate the symbol from dotree.

Why does this work?
But this not work?

Right, maybe this is just another "nil is not ()" difference with Common Lisp. Sorry, CL was what taught me how to think Lisp.

Calling (first) on an empty list gives an error instead of returning the empty list. This is inconsistent with the documentation, which claims that first behaves the same as car in other Lisp implementations. On the contrary, ; sbcl This is SBCL 1.0.18.debian, an implementation of ANSI Common Lisp. ...

For very large lists/arrays, what is the time improvement for accessing the last element of either structure? I imagine that for arrays, the time taken to access the last element is flat, but for lists grows as the list size grows. Do arrays have restrictions on size (e.g., can't be indexed past the...

You can turn off prompts with the -c option. Don't know how to get a () (I don't think readlines even supports that, emacs probably does). There doesn't seem to be a quiet or suppress option; that needs to be added.

I don't see anything on the newLisp website guaranteeing that the API is stable anyway. If he wants to remove something or change its behavior, the worst you have to do is probably a find-replace. Unless the behavior of a fundamental, commonly used function is totally changed, which isn't what this ...

For expressions that need to be evaluated sequentially in newLisp, there is no progn special form that says "evaluate these and return the last". So how do I make code like this valid? (if (expr) ((eval 1) (eval 2) (eval3)) (eval4)) It seems to execute the forms correctly, except that at the end of ...

Too late, already wrote my own function. Will consider replacing if necessary later (I have doubts that mine works correctly).

I need to use the SHA1 function in libssl.so. The function has the following syntax: unsigned char *SHA1(const unsigned char *d, unsigned long n, unsigned char *md); With the explanation SHA1() computes the SHA-1 message digest of the n bytes at d and places it in md (which must have space for SHA_D...

In CL the answer would be macros. In NL I'm pretty sure the answer is still macros. What exactly are you trying to accomplish (explain)?

I think you can in Scheme define if as a function; however, in CL, because the rest of a list is evaluated before the head is, if must be a special form, and cannot be written as a function.

I don't understand this misconception that Common Lisp/Scheme are faster just because they are compiled. In most benchmarks they perform worse than Perl (which we'll call a "fast" interpreted language) even when speed 3 safety 0 is on. When I saw the mergesort benchmark, I was pretty impressed; newL...

I'm knew CL first, so the closing ) on their own lines looks wrong to me. Stacking parentheses on the end of lines has always seemed the logical thing to do (unlike }'s, which look ugly when stacked together).

I hail from Common Lisp, where the entire idea of macros is completely different, it seems, from that of newLisp. Could someone please explain to me exactly what a newLisp macro does? Does it evaluate its body and not evaluate its inputs? Or does it evaluate its inputs but not its body? How can I us...