• [Reminder CfP] ELS 2019, 12th European Lisp Symposium, April 1-2, Genov

    From Didier Verna@21:1/5 to All on Sat Jan 12 12:54:59 2019
    ELS'19 - 12th European Lisp Symposium

    Hotel Bristol Palace
    Genova, Italy

    April 1-2 2019

    In cooperation with: ACM SIGPLAN
    In co-location with <Programming> 2019
    Sponsored by EPITA


    Recent news:
    - Keynote by Stefan Monnier on Emacs Lisp
    - Keynote by Christophe Rhodes on SBCL
    - Guest appearance by Matthew Flatt on Racket

    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 12th 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=els2019

    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:
    - 01 Feb 2019 Submission deadline
    - 01 Mar 2019 Notification of acceptance
    - 18 Mar 2019 Final papers due
    - 01-02 Apr 2019 Symposium

    Programme chair:
    Nicolas Neuss, FAU Erlangen-Nürnberg, Germany

    Programme committee:
    Marco Antoniotti, Universita Milano Bicocca, Italy
    Marc Battyani, FractalConcept, France
    Pascal Costanza, IMEC, ExaScience Life Lab, Leuven, Belgium
    Leonie Dreschler-Fischer, University of Hamburg, Germany
    R. Matthew Emerson, thoughtstuff LLC, USA
    Marco Heisig, FAU, Erlangen-Nuremberg, Germany
    Charlotte Herzeel, IMEC, ExaScience Life Lab, Leuven, Belgium
    Pierre R. Mai, PMSF IT Consulting, Germany
    Breanndán Ó Nualláin, University of Amsterdam, Netherlands
    François-René Rideau, Google, USA
    Alberto Riva, Unversity of Florida, USA
    Alessio Stalla, ManyDesigns Srl, Italy
    Patrick Krusenotto, Deutsche Welle, Germany
    Philipp Marek, Austria
    Sacha Chua, Living an Awesome Life, Canada

    Search Keywords:

    #els2019, ELS 2019, ELS '19, European Lisp Symposium 2019,
    European Lisp Symposium '19, 12th ELS, 12th European Lisp Symposium,
    European Lisp Conference 2019, European Lisp Conference '19

    Resistance is futile. You will be jazzimilated.

    Didier Verna <didier@elsaa.org>
    ELS Steering Committee

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)