- pro - mailman3.common-lisp.net

Re: Common Lisp Blockchain - Scheme Coin
by Alessio Stalla 19 Dec '17

19 Dec '17

Well, that's a great idea! Il 19 dic 2017 11:36, "David McClain" <dbm(a)refined-audiometrics.com> ha scritto: It seems to me that, instead of performing totally useless computations for POW, a group like CERN might enlist the miners to search for W-Boson events from their detector trails, or astronomers might enlist the mining enclaves to search for SETI events… (no joke…) - DM On Dec 18, 2017, at 23:03, Antoniotti Marco <antoniotti.marco@disco. unimib.it> wrote: On Dec 18, 2017, at 23:54 , Pascal Bourguignon <pjb(a)informatimago.com> wrote: On 18 Dec 2017, at 23:31, David McClain <dbm(a)refined-audiometrics.com> wrote: umm… was this supposed to be some kind of joke? I’ll bite... I don’t get it. I was actually hoping to learn something here... But the code does look rather peculiar on close inspection. Why the use of macros for pushing new transaction blocks? And the conversions to octet vectors may work for strings, but not in general for arbitrary integer or float values… If it is supposed to be a joke, I’ll chuckle and just chuck the code… I guess not: https://dev.to/damcosset/trying-to-understand- blockchain-by-making-one-ce4 It’s like, everybody will be busy implementing blockchains. It’s the new fizz-buzz… … or planting tulips :) :) :) Cheers MA -- Marco Antoniotti

1 0

[CfP] 11th European Lisp Symposium, 16-17 Apr 2018, Marbella, Spain
by Didier Verna 18 Dec '17

18 Dec '17

ELS'18 - 11th European Lisp Symposium Centro Cultural Cortijo de Miraflores Marbella, Málaga Spain April 16-17 2018 Sponsored by EPITA http://www.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, Hop and so on. We encourage everyone interested in Lisp to participate. The 11th European Lisp Symposium invites high quality papers about novel research results, insights and lessons learned from practical applications and educational perspectives. We also encourage submissions about known ideas as long as they are presented in a new setting and/or in a highly elegant way. Topics include but are not limited to: - Context-, aspect-, domain-oriented and generative programming - Macro-, reflective-, meta- and/or rule-based development approaches - Language design and implementation - Language integration, inter-operation and deployment - Development methodologies, support and environments - Educational approaches and perspectives - Experience reports and case studies We invite submissions in the following forms: Papers: Technical papers of up to 8 pages that describe original results or explain known ideas in new and elegant ways. Demonstrations: Abstracts of up to 2 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. The symposium will also provide slots for lightning talks, to be registered on-site every day. All submissions should be formatted following the ACM SIGS guidelines and include ACM Computing Classification System 2012 concepts and terms. Submissions should be uploaded to Easy Chair, at the following address: https://www.easychair.org/conferences/?conf=els2018 Note: to help us with the review process please indicate the type of submission by entering either "paper", "demo", or "tutorial" in the Keywords field. Important dates: - 18 Feb 2018 Submission deadline - 19 Mar 2018 Notification of acceptance - 25 Mar 2018 Early registration deadline - 02 Apr 2018 Final papers due - 16-17 Apr 2018 Symposium Programme chair: David Cooper, Genworks Intl., USA Local chairs: Andrew Lawson & Nick Levine, Ravenpack, Spain Programme committee: tba Search Keywords: #els2018, ELS 2018, ELS '18, European Lisp Symposium 2018, European Lisp Symposium '18, 10th ELS, 10th European Lisp Symposium, European Lisp Conference 2018, European Lisp Conference '18 -- Resistance is futile. You will be jazzimilated. Lisp, Jazz, Aïkido: http://www.didierverna.info

1 0

Maintainers needed
by Faré 18 Dec '17

18 Dec '17

Many prominent CL developers have stopped maintaining their CL projects, as I myself may do soon: Nathan Froyd, Henrik Hjelte, Hans Hübner, David Lichteblau, Gabor Melis, Nikodemus Siivola, etc. Some of their projects have lots of unanswered PRs on github an some even break when compiled with a recent Quicklisp and/or the newest ASDF. Many don't break yet, but issue warnings and may break in the future. Some old farts like Gary King or I only do minimal maintenance of our own projects, and we're mortal — I'm considering quitting even that maintenance. Since I'm jumping ship, I won't be the one to fork these projects and give them a new home (though I'm available to do it, for my consulting fee, if there's enough of a market). Some of you CL professionals should do it and/or fund it. https://github.com/sharplispers might be a good home. —♯ƒ • François-René ÐVB Rideau •Reflection&Cybernethics• http://fare.tunes.org If being against something is a phobia, then being for is mania. Peace and understanding through slurs of mental illness. Homomania, islamomania, etc.

11 15

Hashing "object identities"
by Antoniotti Marco 04 Dec '17

04 Dec '17

Hi I am fooling around with a problem that eventually will have to use a hash table on “triples” of “integers” and “structures". Triples I can portably pass to the EQUAL hash table. I cannot use an EQUALP hash table, because I would end up wasting to much time. Here is the rub: my triples <N, O1, O2> need to use the “object identity” of O1 and O2 (two structs). I could switch to an EQL hash table keyed on (HASH-TRIPLE-KEY N O1 O2). How would you proceed (or write HASH-TRIPLE), while staying as much portable as possible? As you well know SXHASH is practically useless. Thanks — Marco -- Marco Antoniotti, Associate Professor tel. +39 - 02 64 48 79 01 DISCo, Università Milano Bicocca U14 2043 http://bimib.disco.unimib.it Viale Sarca 336 I-20126 Milan (MI) ITALY Please check: http://cdac2018.lakecomoschool.org Please check: http://troncopackage.org Please note that I am not checking my Spam-box anymore. Please do not forward this email without asking me first (cum grano salis).

8 14

Re: ML Maintainer wanted
by Sky Hester 02 Dec '17

02 Dec '17

Seems like it would be a good service to keep up. I volunteer, if no one else has already spoken up. -Sky On Nov 30, 2017 5:53 AM, "Hans Hübner" <hans.huebner(a)gmail.com> wrote: Hi, I would like to step down from being the pro@ mailing list maintainer. It is not a lot of regular work (maybe one or two visits to the Mailman page per month to forward or reject a message from a non-subscriber), but it might be that the list needs to be moved or something and I would like to avoid getting into a situation where maintenance is required and I don't have time to do it. Also, I'm not a professional Common Lisp user anymore, so I don't qualify for the list at this point anyway :D Any takers? Thanks, Hans

7 10

Re: ML Maintainer wanted
by Hans Hübner 30 Nov '17

30 Nov '17

2017-11-30 17:13 GMT+01:00 R. Matthew Emerson <rme(a)acm.org>: > Well, I assume the password isn't going to be that for much longer, since > it was accidentally sent out to the mailing list... :-O > Nice one! 30 years of email and I still can't work it out! Sky is nominated to be the keeper of the new password. :) Cheers, Hans

2 1

ML Maintainer wanted
by Hans Hübner 30 Nov '17

30 Nov '17

Hi, I would like to step down from being the pro@ mailing list maintainer. It is not a lot of regular work (maybe one or two visits to the Mailman page per month to forward or reject a message from a non-subscriber), but it might be that the list needs to be moved or something and I would like to avoid getting into a situation where maintenance is required and I don't have time to do it. Also, I'm not a professional Common Lisp user anymore, so I don't qualify for the list at this point anyway :D Any takers? Thanks, Hans

1 0

Optimizing a function over multiple types for its arguments
by Chaitanya Gupta 28 Nov '17

28 Nov '17

While I was working on qbase64[1], I stumbled over a peculiar problem: I wanted it to work as fast as possible when optimized array types (SIMPLE-ARRAY, SIMLPE-BASE-STRING, etc.) were passed to the encoding/decoding routines, but I also wanted to support the more general types. If I defined my core encoding routine like this: (defun %encode (bytes string) (declare (type (simple-array (unsigned-byte 8)) bytes)) (declare (type simple-base-string string)) (declare (optimize speed)) ...) SBCL would produce very fast code, but the function would no longer work for other ARRAY or STRING types: And if I was to redefine the routine with more general types: (defun %encode (bytes string) (declare (type array bytes)) (declare (type string string)) (declare (optimize speed)) ...) The code produced would be significantly slower. My solution to this conundrum was to create a macro that would take all the different type combinations I wanted to optimize and support upfront: (defun/td %encode (bytes string) (((bytes (simple-array (unsigned-byte 8))) (string simple-base-string)) ((bytes (simple-array (unsigned-byte 8))) (string simple-string)) ((bytes array) (string string))) (declare (optimize speed)) ...) and generate code which would dispatch over the type combinations, then use LOCALLY to actually declare the types and splice the body in: (defun %encode (bytes string) (cond ((and (typep bytes '(simple-array (unsigned-byte 8))) (typep string 'simple-base-string)) (locally (declare (type bytes (simple-array (unsigned-byte 8)))) (declare (type string simple-base-string)) (declare (optimize speed)) ...)) ((and (typep bytes '(simple-array (unsigned-byte 8))) (typep string 'simple-string)) (locally (declare (type bytes (simple-array (unsigned-byte 8)))) (declare (type string simple-string)) (declare (optimize speed)) ...)) ((and (typep bytes 'array) (typep string 'string)) (locally (declare (type bytes array)) (declare (type string string)) (declare (optimize speed)) ...)) (t (error "Unsupported type combination")))) If the run-time dispatch incurs a slight penalty, it is more than offset by gains made by using optimized array types, esp. since these routines have to typically visit every element of the given arrays. I was wondering if there was a better way to do this. Have I missed a trick or two? I was reading about the Lisp Interface Library[2] which supports parametric polymorphism, but not sure if it would result in optimized code like the one my macro generates. Chaitanya 1. https://github.com/chaitanyagupta/qbase64 2. https://common-lisp.net/%7Efrideau/lil-ilc2012/lil-ilc2012.html

2 2

lisp.org
by Nick Levine 20 Nov '17

20 Nov '17

Now that we've established why lisp.org and its friends are long-term off air... The website at lisp.org contained a photo of John McCarthy (and nothing else) since the week he died six years ago. What's the message? In contrast take a quick look at (say) python.org, a site devoted to really assisting people to use that language. Do we care, and if we do how do we go about effecting change? - nick

8 8

Can compiler macros make use of type declarations?
by Chaitanya Gupta 09 Nov '17

09 Nov '17

Let's say I have created a function called `FOO`: (defun foo (x) ...) To optimize this function, I write a compiler macro. Can I make use of type declarations that users of `FOO` might have made for the argument `X` that is passed in to it? That is, let's say `FOO` is used like this: (let ((a (something-that-returns-an-integer))) (declare (integer a)) (foo a)) The compiler macro for `FOO` cannot make any optimizations on the value of `A`, but can it take advantage of the fact that `A` is declared as in `INTEGER` here? Chaitanya

7 15