pro February 2021

pro@common-lisp.net

15 participants
5 discussions

[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

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

pro February 2021