- pro - mailman3.common-lisp.net

[CfP] 15th European Lisp Symposium, March 21-22 2022, Porto, Portugal
by Didier Verna 20 Oct '21

20 Oct '21

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 15th European Lisp Symposium Call for Papers March 21-22, 2022 FEUP, Porto, Portugal & Online In co-location with <Programming> http://www.european-lisp-symposium.org/2022 Sponsored by EPITA ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Important Dates ~~~~~~~~~~~~~~~ - Submission deadline: January 23, 2022 - Author notification: February 21, 2022 - Final papers due: March 7, 2022 - Symposium: March 21-22, 2022 Scope ~~~~~ The European Lisp Symposium is a premier forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp dialects, including Common Lisp, Scheme, Emacs Lisp, Clojure, Racket, ACL2, AutoLisp, ISLISP, Dylan, SKILL, Hy, Shen, Carp, Janet, uLisp, Picolisp, Gamelisp, TXR, and so on. We encourage everyone interested in Lisp to participate. The 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 Technical Program ~~~~~~~~~~~~~~~~~ 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 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. 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 http://www.easychair.org/conferences/?conf=els2021 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. Programme Chair ~~~~~~~~~~~~~~~ Jim Newton - EPITA Research Lab (LRDE), France Programme Committee ~~~~~~~~~~~~~~~~~~~ tba -- Resistance is futile. You will be jazzimilated. Lisp, Jazz, Aïkido: http://www.didierverna.info

1 0

[Reminder CfP] ELS 2021, 14th European Lisp Symposium, May 3-4
by Didier Verna 25 Feb '21

25 Feb '21

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 14th European Lisp Symposium Call for Papers May 3 - May 4, 2021 Online / Everywhere http://www.european-lisp-symposium.org/2021 Sponsored by EPITA and RavenPack ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Invited Speakers ~~~~~~~~~~~~~~~~ Nada Amin - Harvard SEAS others tba Important Dates ~~~~~~~~~~~~~~~ - Submission deadline: March 7, 2021 - Author notification: April 6, 2021 - Final papers due: April 19, 2021 - Symposium: May 3 - May 4, 2021 Scope ~~~~~ The European Lisp Symposium is a premier forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp dialects, including Common Lisp, Scheme, Emacs Lisp, Clojure, Racket, ACL2, AutoLisp, ISLISP, Dylan, SKILL, Hy, Shen, Carp, Janet, uLisp, Picolisp, Gamelisp, TXR, and so on. We encourage everyone interested in Lisp to participate. The European Lisp Symposium 2021 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 Technical Program ~~~~~~~~~~~~~~~~~ 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 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. 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 http://www.easychair.org/conferences/?conf=els2021 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. Programme Chair ~~~~~~~~~~~~~~~ Marco Heisig - FAU Erlangen-Nürnberg, Germany Local Chairs ~~~~~~~~~~~~ Michał Herda Mark Evenson - RavenPack Programme Committee ~~~~~~~~~~~~~~~~~~~ Ioanna Dimitriou - Igalia Irène Durand - LaBRI University of Bordeaux R. Matthew Emerson - thoughtstuff LLC Matthew Flatt - University of Utah Jonathan Godbout - Google Paulo Matos - Linki Tools David McClain - SpectroDynamics, LLC Stefan Monnier - University of Montreal Jim Newton - EPITA Research Lab Kent Pitman - HyperMeta Inc. Christophe Rhodes - Google Kai Selgrad - OTH Regensburg Olin Shivers - Northeastern University Robert Smith - Rigetti Quantum Computing Michael Sperber - DeinProgramm Evrim Ulu - Middle East Technical University Breanndán Ó Nualláin - Machine Learning Programs -- Lisp, Jazz, Aïkido: http://www.didierverna.info

1 0

Pattern, Abstract Factory / Factory
by Manfred Bergmann 08 Feb '21

08 Feb '21

Hello. I am trying to discover design patterns and how they are implemented in Common Lisp. According to Peter Norvig (http://norvig.com/design-patterns/design-patterns.pdf) and this source (https://wiki.c2.com/?AreDesignPatternsMissingLanguageFeatures) some design pattern are more simple in Common Lisp, or are actually not needed at all because the language can be extended to achieve the same thing: extendability, separation, abstraction. Taking an Abstract Factory for example, the sources say that metaclasses can help do this. I’ve read a bit about metaclasses and the MOP but I fail to see how. I could probably come up with something. A GUI framework for example. I could create something like this : — (defclass meta-button (standard-class) ((gui-button-backend :initform nil :accessor gui-button-backend))) (defmethod closer-mop:validate-superclass ((class meta-button) (superclass standard-class)) t) (defclass button () () (:metaclass meta-button)) (defun make-button () (make-instance 'button)) — And configure a QT or GTK, Motif (or whatever) button backend to the metaclass on startup (or so). But I think this would just be the pattern somehow turned into a metaclass. Doesn’t feel like the right thing. Does anyone know what Peter Norvig had in mind when he said that metaclasses can be used instead of Abstract Factory pattern? Cheers, Manfred

11 35

Another (stupid) question: "find first set" (or "find first zero")
by Marco Antoniotti 02 Feb '21

02 Feb '21

Hi I am wasti.... devoting some time to recreational hacking and I bumped into an interesting bit fiddling operation. I pored over the CLHS, but, while I may have missed something obvious, I am not sure what would be the best way to implement such a function using the standard operations. Any ideas? Note that it appears that most HW does have an instruction to do that directly. Find first set - Wikipedia <https://en.wikipedia.org/wiki/Find_first_set> 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

5 9

Re: Another (stupid) question: "find first set" (or "find first zero")
by Marco Antoniotti 02 Feb '21

02 Feb '21

"Duh again", in the sense that I was stupid (again!) 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

3 2

Re: Another (stupid) question: "find first set" (or "find first zero")
by Marco Antoniotti 02 Feb '21

02 Feb '21

Thank you Pascal great pointer. I was unaware of this book. All the best 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

1 0

Questions about complexity of some functions in various implementations.
by Marco Antoniotti 23 Jan '21

23 Jan '21

Hello everybody I remember from the trenches that LW implementation of INTERSECTION and UNION does not have (expected) linear time complexity. Before I go ahead checking the various implementations, does anybody know what is the time complexity of, at least, FIND, FIND-IF, POSITION and POSITION-IF for VECTOR inputs in various implementations? That is, does anybody know whether these functions have at least O(lg n) time complexity in any of the implementations out there? All the best 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

3 3

[CfP] ELS'21, 14th European Lisp Symposium, online, May 3-4 2021
by Didier Verna 23 Dec '20

23 Dec '20

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 14th European Lisp Symposium Call for Papers May 3 - May 4, 2021 Online / Everywhere http://www.european-lisp-symposium.org/2021 Sponsored by EPITA and RavenPack ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Invited Speakers ~~~~~~~~~~~~~~~~ tba Important Dates ~~~~~~~~~~~~~~~ - Submission deadline: March 7, 2021 - Author notification: April 6, 2021 - Final papers due: April 19, 2021 - Symposium: May 3 - May 4, 2021 Scope ~~~~~ The European Lisp Symposium is a premier forum for the discussion and dissemination of all aspects of design, implementation and application of any of the Lisp dialects, including Common Lisp, Scheme, Emacs Lisp, Clojure, Racket, ACL2, AutoLisp, ISLISP, Dylan, SKILL, Hy, Shen, Carp, Janet, uLisp, Picolisp, Gamelisp, TXR, and so on. We encourage everyone interested in Lisp to participate. The European Lisp Symposium 2021 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 Technical Program ~~~~~~~~~~~~~~~~~ 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 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. 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 http://www.easychair.org/conferences/?conf=els2021 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. Programme Chair ~~~~~~~~~~~~~~~ Marco Heisig - FAU Erlangen-Nürnberg, Germany Local Chairs ~~~~~~~~~~~~ Michał Herda Mark Evenson - RavenPack Programme Committee ~~~~~~~~~~~~~~~~~~~ tba -- Didier Verna

1 0

In CLOS, instance remorphing considered useless in practice?
by Jean-Claude Beaudoin 16 Dec '20

16 Dec '20

Hello Pros of Common Lisp, Here is my attempt at starting a significant (and hopefully useful) debate on a subject squarely about Common Lisp and its internals. My main stance here is to state that I have yet to see, in a significant application, any use of functions #'cl:make-instance-obsolete and #'cl:update-instance-for-redefined-class and of the underlying machinery that support the remorphing of instances following a class redefinition (through a subsequent cl:defclass most likely). I can state the same thing about #'cl:update-instance-for-different-class and #'cl:change-class. The machinery required of any CL implementation to properly support those functions (mentioned here above) is quite significant in its complexity and usually imposes a sizeable performance penalty on the speed of any instance slot access. A different choice of class redefinition semantics can lead to an implementation of CLOS with much reduced instance slot access overhead. The necessity of supporting instance remorphing should therefore be well motivated by very significant gains in application code performance (in speed and/or size and/or expressiveness power). Can anyone of you point me to some evidence of such application level usefulness? Is there any notorious usecase of this (instance remorphing) since its inclusion into ANSI CL? By the way, at the bottom of the entry about #'cl:change-class in the text of the CL standard, one can find a "Notes:" section that starts with this sentence: "The generic function change-class has several semantic difficulties." And this was written in the context of a single-threaded implementation, as ANSI-CL limited itself. I bet that almost all currently significant CL implementations are now multi-threaded, therefore the "several semantic difficulties" are greatly and gravely compounded. In my opinion, this makes proper motivation of usefulness all the more imperious. What do you think?

18 38

Re: Call for Interest: Clojure (or Lisp?) Code Camp with BLM focus
by Ken Tilton 08 Dec '20

08 Dec '20

Sounds great, I will keep it in mind if we loosen the web/mobile-native constraint. Or maybe as a direction for campers who take off -- no need then to fret over platform, power will matter. Thx! On Mon, Jul 6, 2020 at 10:54 AM Stonewall Ballard <stoney(a)sb.org> wrote: > Ken, > > Are you familiar with Opusmodus? > <http://opusmodus.com> > > It’s written in Clozure ccl, and besides providing an incredible array of > music manipulation functions and structures, it’s got a beautiful window > system. Mac only. > > Your idea of using music as a hook to learn Lisp sounds plausible. Good > Luck! > > - Stoney > ———— > Stonewall Ballard stoney(a)sb.org http://stoney.sb.org > > On Monday, July 6 at 8:15:31 AM, Ken Tilton (kentilton(a)gmail.com) wrote: > > So I got to thinking about creating an approachable pathway to IT careers > for anyone really, but in the spirit of today one focused on creating > career opportunities for African Americans. > > The idea would be a code camp developed around algorithmic generation of > music. I know nothing about music theory, except that there is prolly > enough there to introduce most if not all fundamental programming concepts. > > For those campers that accidentally get hooked on programming itself, > which is how many of us ended up in IT careers, away they go! > > The idea is to: > > - use music as the hook; > - defer as long as possible the annoying things about programming (I > am looking at you, node.js); > - part of that ^^^ will be using a powerful language with the > parentheses in the right place, prolly ClojureScript since that could run > where JS runs; > - keep programming as the focus, as tempting as the music will be. > Sonic Pi comes with all sorts of built-in sound capabilities, but we want > to *develop* those in the code camp; > - tailor the program to specific musical genres, to maximize the > musical hook. > > I am dropping this here since I know many Common Lispers have a strong > musical bent. My questions are: > > - Could we use CL instead? I do think this almost has to be a web app, > perhaps even mobile. Hmmm, we *could* CL-ify CLJS with > sufficent clever macrology. > - What do you think? Can a solid programming fundamentals course be > expressed in music theory? Hint: HTTP is not a programming fundamental. > - If there is any interest, what would be a good place for an ongoing > discussion? Google groups? > > Ideas, comments, suggestions all welcome. > > -hk > > -- Kenneth Tilton http://tiltontec.com/

22 49