LispForum

In the RB tree example, you would need to create a specialized syntax for every kind of ordering (#'<, #'>, #'whatever), which, I agree, is not ideal. Correct me if I am wrong, but the compile-time structures you were talking about is information about the variables being used, right? Suppose that ...

Sorry again for the delay, unquestionably I am not getting mail. I will begin to poll the forum for now on. How cool, I got pretty enlightening answers! Thanks! @gugamilare: It seems your code for is-function-or-lambda-p is broken? "fun" is undefined, "membar" is a mispell (I thi...

Sorry for the long reply time, but apparently I did not receive any email from the forum. Ramarren: Well, I admit this is some kind of premature optimization, but I really want to do it now because I am not tolerating a suboptimal final system and when profiling tells me there is an overhead intrins...

Hi, I am trying to code a set of algebraic algorithms parameterised on structures such as rings and fields. My primary concern is efficiency. Since algorithms that take higher-order functions representing the operations on the structure would incur a function call overhead, I have been trying to use...