- pro - mailman3.common-lisp.net

[pro] what lisp command line arg parser is good?
by Mark H. David 21 Dec '11

21 Dec '11

Anyone with some thoughts on which command line parser is good to use? There seem to be n of them out there. None really stands out, that I can tell. Must be quicklisp readable, other than that, I don't have any kind of fancy requirements. Just something simple, and reliable. Widely used would be good, and/or well maintained. Any pro tips? Thanks, Mark

8 10

[pro] Keyword arguments and compiler macros
by Juan Jose Garcia-Ripoll 05 Dec '11

05 Dec '11

[Sorry for possible duplicates] I just realized that compiler macros might be too restrictive in some implementations. Take for instance (define-compiler-macro foo (a &key key-arg) ...) This is assuming that FOO is only going to be invoked with _constant_ keyword arguments. I know, I know, most uses will have always one argument or :KEY-ARG, but suppose you want to call (FOO some-value a-non-constant-expression some-other-value)... What is the compiler to do? I _now_ think that the compiler macro processor should simply recognize the failure to parse the form and return the original form, unprocessed, but the implementations I have at hand do not do that. ECL to begin with, but also CCL and SBCL. Any opinions on this? Juanjo -- Instituto de Física Fundamental, CSIC c/ Serrano, 113b, Madrid 28006 (Spain) http://juanjose.garciaripoll.googlepages.com

5 8

[pro] Bignum Arithmetic
by David McClain 04 Dec '11

04 Dec '11

I'm getting more deeply involved in Bignum prime-field and Elliptic Curve computations. Wonder if anyone knows the degree to which the Bignum support in Lisp is enhanced, in the sense that multiple algorithms can be used for, e.g., multiplication, depending on bignum operand sizes. FFT's over integer fields for large numbers, Montgomery multiplication elsewhere, etc.?? I just reviewed GnuMP docs and saw a fairly sophisticated collection of internal optimizations. Would it pay to migrate to GnuMP for specialized applications? Dr. David McClain dbm(a)refined-audiometrics.com

6 5

[pro] Mark Kantrowitz infix.lisp easter egg?
by Alexander Repenning 03 Dec '11

03 Dec '11

Using Mark Kantrowitz old but very handy infix we noticed some peculiar pattern of errors where very basic expressions do not correctly convert infix expressions into prefix ones. The version I just tried was this one: http://www.cliki.net/infix in => pre, red for incorrect "a + 1" => (+ A 1) "s + 1" => S+1 "s - 1" => S-1 "s * 1" => (* S 1) "a + 1.5" => (+ A 1.5) "s + 1.5" => (+ S 1.5) "s + s" => (+ S S) "s + 1 + 1" => (+ S+1 1) "s + 1e1" => (+ S 10.0) Can somebody see a pattern here? AFAIK, the combination of the one letter variables names that are characters D, E, F, L, or S followed by "+" or "-" and then followed by an int does not work. Is this a bug or some very special case that is supposed to work like this for no (to me) obvious reason? If this is bug, how could this have slipped through the net for so many years? I know many people have using this software. I tried various versions of infix.lisp. Are D, E, F, L, or S special tokens? If so, what do they mean, and where are they declared? Confused, Alex ---- test program spitting out the variable names not working ------ This should print nothing: (map nil #'(lambda (Char) (when (symbolp (read-from-string (format nil "#i(~A + 1)" Char))) ;; should be a list, NOT a symbol! (print Char))) "ABCDEFGHIJKLMNOPQRSTUVWXYZ") but prints: #\D #\E #\F #\L #\S Prof. Alexander Repenning University of Colorado Computer Science Department Boulder, CO 80309-430 vCard: http://www.cs.colorado.edu/~ralex/AlexanderRepenning.vcf

3 3

[pro] [ELS 2012] European Lisp Symposium 2012, Zadar, Croatia; call for papers
by Marco Antoniotti 17 Nov '11

17 Nov '11

Apologies for the multiple postings.... ================================================================ European Lisp Symposium 2012, Zadar, Croatia, April 30th - May 1st, 2012 http://european-lisp-symposium.org The purpose of the European Lisp Symposium is to provide a forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp and Lisp-inspired dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP, Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, and so on. We encourage everyone interested in Lisp to participate. The main theme of the 2012 European Lisp Conference is "Interoperabilty: Systems, Libraries, Workflows". Lisp based and functional-languages based systems have grown a variety of solutions to become more and more integrated with the wider world of Information and Communication Technologies in current use. There are several dimensions to the scope of the solutions proposed, ranging from "embedding" of interpreters in C-based systems, to the development of abstractions levels that facilitate the expression of complex context dependent tasks, to the construction of exchange formats handling libraries, to the construction of theorem-provers for the "Semantic Web". The European Lisp Symposium 2012 solicits the submission of papers with this specific theme in mind, alongside the more traditional tracks which have appeared in the past editions. We invite submissions in the following forms: Papers: Technical papers of up to 15 pages that describe original results or explain known ideas in new and elegant ways. Demonstrations: Abstracts of up to 4 pages for demonstrations of tools, libraries, and applications. Tutorials: Abstracts of up to 4 pages for in-depth presentations about topics of special interest for at least 90 minutes and up to 180 minutes. Lightning talks: Abstracts of up to one page for talks to last for no more than 5 minutes. All submissions should be formatted following the ACM SIGS guidelines and include ACM classification categories and terms. For more information on the submission guidelines and the ACM keywords, see: http://www.acm.org/sigs/publications/proceedings-templates and http://www.acm.org/about/class/1998. Important dates: Jan 31st 2012: submission deadline Feb 21st 2012: acceptance results April 30th, 2012 Conference opens Program Commitee. Chair: Marco Antoniotti, Università degli Studi di Milano Bicocca, Milan, ITALY Local organizers: • Damir Ćavar, Eastern Michigan University • Franjo Pehar, University of Zadar • Damir Kero, University of Zadar Members: • Giuseppe Attardi, Università degli Studi di Pisa, Pisa, ITALY • Pascal Costanza, Intel, Bruxelles, BELGIUM • Marc Feeley, Université de Montreal, Montreal, CANADA • Scott McKay, Google, U.S.A. • Kent Pitman, Hypermeta, U.S.A. • Christophe Rhodes, Department of Computing, Goldsmiths, University of London, London, UNITED KINGDOM • Robert Strandh, LABRI, Université de Bordeaux, Bordaux, FRANCE • Didier Verna, EPITA / LRDE, FRANCE -- Marco Antoniotti

1 0

[pro] [ELS 2012] European Lisp Symposium 2012, Zadar, Croatia; call for papers
by Marco Antoniotti 17 Nov '11

17 Nov '11

Apologies for the multiple postings.... ================================================================ European Lisp Symposium 2012, Zadar, Croatia, April 30th - May 1st, 2012 http://european-lisp-symposium.org The purpose of the European Lisp Symposium is to provide a forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp and Lisp-inspired dialects, including Common Lisp, Scheme, Emacs Lisp, AutoLisp, ISLISP, Dylan, Clojure, ACL2, ECMAScript, Racket, SKILL, and so on. We encourage everyone interested in Lisp to participate. The main theme of the 2012 European Lisp Conference is "Interoperabilty: Systems, Libraries, Workflows". Lisp based and functional-languages based systems have grown a variety of solutions to become more and more integrated with the wider world of Information and Communication Technologies in current use. There are several dimensions to the scope of the solutions proposed, ranging from "embedding" of interpreters in C-based systems, to the development of abstractions levels that facilitate the expression of complex context dependent tasks, to the construction of exchange formats handling libraries, to the construction of theorem-provers for the "Semantic Web". The European Lisp Symposium 2012 solicits the submission of papers with this specific theme in mind, alongside the more traditional tracks which have appeared in the past editions. We invite submissions in the following forms: Papers: Technical papers of up to 15 pages that describe original results or explain known ideas in new and elegant ways. Demonstrations: Abstracts of up to 4 pages for demonstrations of tools, libraries, and applications. Tutorials: Abstracts of up to 4 pages for in-depth presentations about topics of special interest for at least 90 minutes and up to 180 minutes. Lightning talks: Abstracts of up to one page for talks to last for no more than 5 minutes. All submissions should be formatted following the ACM SIGS guidelines and include ACM classification categories and terms. For more information on the submission guidelines and the ACM keywords, see: http://www.acm.org/sigs/publications/proceedings-templates and http://www.acm.org/about/class/1998. Important dates: Jan 31st 2012: submission deadline Feb 21st 2012: acceptance results April 30th, 2012 Conference opens Program Commitee. Chair: Marco Antoniotti, Università degli Studi di Milano Bicocca, Milan, ITALY Local organizers: • Damir Ćavar, Eastern Michigan University • Franjo Pehar, University of Zadar • Damir Kero, University of Zadar Members: • Giuseppe Attardi, Università degli Studi di Pisa, Pisa, ITALY • Pascal Costanza, Intel, Bruxelles, BELGIUM • Marc Feeley, Université de Montreal, Montreal, CANADA • Scott McKay, Google, U.S.A. • Kent Pitman, Hypermeta, U.S.A. • Christophe Rhodes, Department of Computing, Goldsmiths, University of London, London, UNITED KINGDOM • Robert Strandh, LABRI, Université de Bordeaux, Bordaux, FRANCE • Didier Verna, EPITA / LRDE, FRANCE -- Marco Antoniotti

1 0

[pro] [Review Request] Small example of modern application of Common Lisp
by Christian von Essen 02 Nov '11

02 Nov '11

Hi, I use CL to scrape several comic websites and generate a website that collects the daily strips from that. The (small) program's features: * Easy definition of comic sources * Uses xpath to get the comics * Stores an archive of daily comics * Generate web pages with comics per day A feature that is IMHO still missing is easier (maybe interactive) comic specification. Currently you better get your xpath right. I think it would be possible to promote CL with an application like that. Could you have a look at the code and give me some hints on style and CL in general, so that the code actually becomes good enough for that purpose? You can find it there: https://github.com/Neronus/Lisp-Utils/blob/master/comics.lisp And an example of the generated output here: http://christian.ftwca.de/comics/ Thank you, Christian

5 4

[pro] Administrativia: Posting through gmame
by Hans Hübner 04 Oct '11

04 Oct '11

Hi, the post earlier today was made through gmame, and that post bounced at multiple subscriber's MTAs because it was considered spam. In order to avoid that, I'm not going to manually forward postings coming in through gmame anymore. Please consider subscribing to the mailing list directly (you can still read through gmame, but you need to post by email). Thanks, Hans

2 1

Re: [pro] help with macro
by karol skocik 26 Sep '11

26 Sep '11

Hi, thanks for help. On Mon, Sep 26, 2011 at 3:02 PM, Scott McKay <swm(a)google.com> wrote: > You're pretty much asking for type inference, but with you > being the one doing the inference. Yes, it's more or less a way to provide more type hints to SBCL. On Mon, Sep 26, 2011 at 4:28 PM, Peter Stirling <peter(a)pjstirling.plus.com> wrote: > You are misunderstanding the way that symbols work: > > First your source code is read by the reader, and symbols are looked up > by their package prefix, or interned in the current package if > unqualified. After this point the raw text that from your lisp file is > thrown away and macro-expansion and compilation is performed using only > the symbols and constants identified/produced by the reader. Since your > macro is trying to shadow symbols rather than generate new ones you only > need to worry about package prefixes at the call site of your macro, and > not in the macro itself > Thanks for explanation. I was confused thinking that reader subsequently reads more of the form as it is expanded, which is rubbish. > :use in defpackage will import all external symbols into the defined > package, and since "+" is external in :cl, and it's highly likely that > you are ":use :cl" it wouldn't need a prefix. > > > (defmacro with-typed-arguments ((name) type &body body) > (let ((func (gensym))) > `(let ((,func #',name)) > (declare (sb-ext:disable-package-locks ,name)) > (macrolet ((,name (&rest args) > (list* 'funcall ',func > (mapcar (lambda (arg) > (list 'the ',type arg)) > args)))) > (declare (sb-ext:enable-package-locks ,name)) > ,@body)))) > > > Should do the expansion you want, but it's not the "right" way in > common-lisp. > Works nicely, thank you! Why do you consider it as not "right"? Have a nice day. Karol > On Mon, 2011-09-26 at 09:31 +0200, karol skocik wrote: >> Hi Lispers, >> I need a help with a following macro I am trying to write: >> >> When the call site looks like this: >> >> (with-typed-arguments (distance) single-float >> (+ (distance a b c d) >> (distance x y z w))) >> >> I want it to expand into something like this: >> >> (+ (DISTANCE (THE SINGLE-FLOAT A) (THE SINGLE-FLOAT B) (THE >> SINGLE-FLOAT C) (THE SINGLE-FLOAT D)) >> (DISTANCE (THE SINGLE-FLOAT X) (THE SINGLE-FLOAT Y) (THE >> SINGLE-FLOAT Z) (THE SINGLE-FLOAT W)))) >> >> Now, what I have currently is: >> >> (defmacro with-typed-arguments ((&rest functions) argument-type &body body) >> (flet ((macrolet-body (fun) >> `(,fun (&rest args) >> `(funcall #',',fun ,@(iter (for arg :in args) >> (collect `(the >> ,',argument-type ,arg))))))) >> `(macrolet (,@(mapcar #'macrolet-body functions)) >> ,@body))) >> >> But it some things I don't understand: >> >> 1.) the function called with typed arguments is called using funcall - >> not a show stopper, just a style issue. Without funcall the expansion >> loops forever since the expansion does not emit the code, but expands >> deeper into infinite recursion of macrolets. Can it be fixed somehow? >> >> 2.) in the flet macrolet-body, I have a trouble understanding ,',fun >> construction next to the funcall - why the "fun" next to funcall can't >> be replaced by macrolet-body argument fun with ,,fun ? It is buried in >> `` but ,,fun there just got me (for call (macrolet-body +)) -> `(,+ >> ...). Let me show my trouble in the example: >> >> In this definition: >> (defmacro with-typed-arguments ((&rest functions) argument-type &body body) >> (flet ((macrolet-body (fun) >> `(,fun (&rest args) >> `(funcall #',,fun ,@(iter (for arg :in args) >> (collect `(the >> ,',argument-type ,arg))))))) >> `(macrolet (,@(mapcar #'macrolet-body functions)) >> ,@body))) >> >> this expansion: >> (with-typed-arguments (distance) single-float >> (+ (distance a b c d) >> (distance x y z w))) >> >> results in this: >> (MACROLET ((DISTANCE (&REST ARGS) >> `(FUNCALL #',DISTANCE >> ;; <- why is there ,DISTANCE when there is `(... `(... ,,fun >> ? >> ,@(ITER >> (FOR ARG :IN ARGS) >> (COLLECT `(THE SINGLE-FLOAT ,ARG)))))) >> (+ (DISTANCE A B C D) (DISTANCE X Y Z W))) >> >> 3.) package-locks - I want it to work with arithmetic functions >> (especially!) defined in CL package. That doesn't work, since I can't >> make a macrolet ((+ (&rest args) ...) because of package-locks. I am >> happy with SBCL specific fix, using SBCL's >> sb-ext:disable-package-locks, or sb-ext:without-package-locks, but I >> can't make it work. >> Especially, I have a trouble understanding, how do I create a symbol >> with package prefix needed in declaration like this: >> (declare (sb-ext:disable-package-locks cl::+)) >> >> Is there a way to prepend the symbol-package and '::' to the given >> symbol? How to construct such fully qualified symbol like cl::+? >> >> Thank you, >> Karol >> >> _______________________________________________ >> pro mailing list >> pro(a)common-lisp.net >> http://lists.common-lisp.net/cgi-bin/mailman/listinfo/pro > > >

1 0

[pro] help with macro
by karol skocik 26 Sep '11

26 Sep '11

Hi Lispers, I need a help with a following macro I am trying to write: When the call site looks like this: (with-typed-arguments (distance) single-float (+ (distance a b c d) (distance x y z w))) I want it to expand into something like this: (+ (DISTANCE (THE SINGLE-FLOAT A) (THE SINGLE-FLOAT B) (THE SINGLE-FLOAT C) (THE SINGLE-FLOAT D)) (DISTANCE (THE SINGLE-FLOAT X) (THE SINGLE-FLOAT Y) (THE SINGLE-FLOAT Z) (THE SINGLE-FLOAT W)))) Now, what I have currently is: (defmacro with-typed-arguments ((&rest functions) argument-type &body body) (flet ((macrolet-body (fun) `(,fun (&rest args) `(funcall #',',fun ,@(iter (for arg :in args) (collect `(the ,',argument-type ,arg))))))) `(macrolet (,@(mapcar #'macrolet-body functions)) ,@body))) But it some things I don't understand: 1.) the function called with typed arguments is called using funcall - not a show stopper, just a style issue. Without funcall the expansion loops forever since the expansion does not emit the code, but expands deeper into infinite recursion of macrolets. Can it be fixed somehow? 2.) in the flet macrolet-body, I have a trouble understanding ,',fun construction next to the funcall - why the "fun" next to funcall can't be replaced by macrolet-body argument fun with ,,fun ? It is buried in `` but ,,fun there just got me (for call (macrolet-body +)) -> `(,+ ...). Let me show my trouble in the example: In this definition: (defmacro with-typed-arguments ((&rest functions) argument-type &body body) (flet ((macrolet-body (fun) `(,fun (&rest args) `(funcall #',,fun ,@(iter (for arg :in args) (collect `(the ,',argument-type ,arg))))))) `(macrolet (,@(mapcar #'macrolet-body functions)) ,@body))) this expansion: (with-typed-arguments (distance) single-float (+ (distance a b c d) (distance x y z w))) results in this: (MACROLET ((DISTANCE (&REST ARGS) `(FUNCALL #',DISTANCE ;; <- why is there ,DISTANCE when there is `(... `(... ,,fun ? ,@(ITER (FOR ARG :IN ARGS) (COLLECT `(THE SINGLE-FLOAT ,ARG)))))) (+ (DISTANCE A B C D) (DISTANCE X Y Z W))) 3.) package-locks - I want it to work with arithmetic functions (especially!) defined in CL package. That doesn't work, since I can't make a macrolet ((+ (&rest args) ...) because of package-locks. I am happy with SBCL specific fix, using SBCL's sb-ext:disable-package-locks, or sb-ext:without-package-locks, but I can't make it work. Especially, I have a trouble understanding, how do I create a symbol with package prefix needed in declaration like this: (declare (sb-ext:disable-package-locks cl::+)) Is there a way to prepend the symbol-package and '::' to the given symbol? How to construct such fully qualified symbol like cl::+? Thank you, Karol

1 0