Poplog common lisp meets the gcl random tester832 (10/22/2004 11:55:57 AM) comp.lang.lisp Prompted by Aaron Sloman's recent message, I downloaded poplog 15.53 and installed it on my x86 linux box. I've been working on a conformance test suite for ANSI Common Lisp (presently containing over 18,000 t... Paul
Question about symbol printing042 (4/19/2004 12:09:56 AM) comp.lang.lisp According to 22.1.3.3, when *print-escape* is bound to true, When printing a symbol, the printer inserts enough single escape and/or multiple escape characters (backslashes and/or vertical-bars) so tha... Paul
(prin1 #\Space)128 (3/6/2004 11:11:26 PM) comp.lang.lisp According to CLtS, section 22.1.3.2: (in discussing printing of characters when printer escaping is enabled) For the graphic standard characters, the character itself is always used for printing in #\... Paul
(CLtS question) Pathname hosts21826 (12/6/2003 5:31:43 PM) comp.lang.lisp On the page for the PATHNAME-HOST function, the function is defined as returning a 'valid pathname host'. In the glossary, this type is defined to be a string, a list of strings, the symbol :unspecific, or a s... Paul
Similarity on circular data structures139 (11/29/2003 8:21:59 AM) comp.lang.lisp Section 3.2.4.2.2 defines the 'similarity' relation on various data structures. For CONS objects, the definition is: Two conses, S and C, are similar if the car[2] of S is similar to the car[2] of C, an... Paul
LOOP for-as-arithmetic clauses: do they allow NIL as a d-var-spec?022 (10/17/2003 12:54:29 PM) comp.lang.lisp The syntax of LOOP says the variable in a for-as-arithmetic clause is a d-var-spec, not a simple-var. Destructuring only makes sense there if the d-var-spec is NIL, meaning don't bind a variable. Is this expe... Paul
IMAGPART on negative floats426 (9/9/2003 11:14:40 PM) comp.lang.lisp Here's another question about the standard... According to the page for IMAGPART: realpart and imagpart return the real and imaginary parts of number respectively. If number is real, then realpart retur... Paul
(upgraded-complex-part-type 'rational) ==> ?333 (8/2/2003 5:57:41 PM) comp.lang.lisp Is it required by ANSI CL that (upgraded-complex-part-type 'rational) be type-equivalent to rational? If so, where does it say that in the standard? Paul ... Paul
defvar / defconstant430 (12/4/2005 6:26:15 PM) comp.lang.lisp Hello, I just began to learn Common Lisp, and as you can imagine I've got some questions. What is the difference between defvar and defconstant ? Both defines a name/value that cannot be changed... Am I wrong... leissing(2)
Failing projects1117 (4/24/2006 7:53:09 PM) comp.software-eng Hello, I am working on an a very large (12+ developers plus testers etc approx 500, 000 lines of code) real time embedded software project which is way overdue and also we cant seem to get down to a point wh... paul4122(2)
CMUCL compile failure: "NIL is not of type C::CONTINUATION"330 (5/24/2006 10:44:37 AM) comp.lang.lisp Hi all, At (declaim (optimize (safety 3))), the following code breaks in compile under CMUCL. It works fine in SBCL 0.8.16. I'm using Debian stable, cmucl is version 19a-release-20040728-11 . I get the same... kevinl1(7)
Relative merits of Lisp-1 vs. Lisp-2?7228 (5/30/2006 9:33:31 PM) comp.lang.lisp What are the relative merits of a Lisp-1 (one namespace for both functions and variable) versus a Lisp-2 (one namespace for functions, and one for variables)? I can think of the following: For Lisp-1: * No #'... JesusWaffle(10)
Amazon used lisp & C exclusively?766194 (7/8/2006 12:58:28 PM) comp.lang.lisp http://www.cabochon.com/~stevey/blog-rants/tour-de-babel.html But sadly they don't have any more openings for lisp. http://tinyurl.com/zaewf What other major companies have posts for lisp? Alok ... alok.bisani(55)
iterative-version for computing a Fibonacci number3240 (7/22/2006 12:09:49 PM) comp.lang.lisp hai guys, i came across "Project Euler" while i was searching for some problems to work on. i find a problem related to Fibonacci numbers. Statement:-- Find the sum of all the even terms in the Fibonacci seq... arnuld3(358)
setf at runtime523 (11/25/2005 2:50:15 PM) comp.lang.lisp Hello Last night I found myself with a simple problem that in the end I couldn't solve. I'm fairly sure there is a simple solution too, i just couldn't finds it. Take note that it was late :) Imagine I... adl(7)
Exponential complexity of combinatorial algorithms2541 (12/4/2005 5:45:17 AM) comp.programming Here's a somewhat dumb question. Why do combinatorial algorithms have an exponential time complexity? The formula for n-combination-r (aka enn-cee-arr) is (n!) /((r!)*((n-r!))). What is the relationship betw... masood.iqbal(34)