‹Programming› 2019
Mon 1 - Thu 4 April 2019 Genoa, Italy

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.

External Website

Additional information about the 12th European Lisp Symposium, ELS 2019 can be found on:
http://www.european-lisp-symposium.org/


Talks

Title
20 more years of bootstrapping ELS Keynote
ELS
Bootstrapping Common Lisp Using Common Lisp
ELS
Finite Automata Theory Based Optimization
ELS
Hierarchical Task Network Planning in Common Lisp
ELS
Implementing Baker’s | SUBTYPEP Decision Procedure
ELS
Lazy, Parallel Multiple Value Reductions in Common Lisp
ELS
Lightning Talks I
ELS

Lightning Talks II
ELS

MAKE-METHOD-LAMBDA Revisited
ELS
Parallelizing Quickref
ELS
Pattern-Based S-Expression Rewriting in Emacs
ELS
Plagiarism Detection for Common Lisp
ELS
Rebooting RacketELS Special Guest
ELS
Shader Pipeline and Effect Encapsulation using CLOS
ELS
Symbols as Namespaces in Common Lisp
ELS
The Lisp of the prophet for the One True EditorELS Keynote
ELS
Welcome message
ELS

Working with First-Order Proofs and Provers
ELS

Initial Call for Papers

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.

Dates
You're viewing the program in a time zone which is different from your device's time zone change time zone

Mon 1 Apr

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

09:00 - 10:30
KeynoteELS at Paganini
09:15
15m
Day opening
Welcome message
ELS

09:30
60m
Talk
The Lisp of the prophet for the One True EditorELS Keynote
ELS
K: Stefan Monnier Université de Montréal
11:00 - 12:30
Emacs Lisp & Lisp ImplementationELS at Paganini
11:00
30m
Talk
Pattern-Based S-Expression Rewriting in Emacs
ELS
Ryan Culpepper Czech Technical University
11:30
30m
Talk
Implementing Baker’s | SUBTYPEP Decision Procedure
ELS
Léo Valais , Jim Newton EPITA / LRDE https://www.lrde.epita.fr, Didier Verna EPITA / LRDE
12:00
30m
Talk
MAKE-METHOD-LAMBDA Revisited
ELS
14:00 - 15:30
Meta-ProgrammingELS at Paganini
14:30
30m
Talk
Finite Automata Theory Based Optimization
ELS
Jim Newton EPITA / LRDE https://www.lrde.epita.fr, Didier Verna EPITA / LRDE
15:00
30m
Talk
Lazy, Parallel Multiple Value Reductions in Common Lisp
ELS
16:00 - 17:00
Code as DataELS at Paganini
16:00
30m
Talk
Working with First-Order Proofs and Provers
ELS
Michael Raskin Université de Bordeaux / LaBRI
16:30
30m
Talk
Plagiarism Detection for Common Lisp
ELS
António Menezes Leitão Technical University of Lisbon, Portugal
17:00
30m
Talk
Lightning Talks I
ELS

Tue 2 Apr

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

14:00 - 15:30
RacketELS at Paganini
14:30
60m
Talk
Rebooting RacketELS Special Guest
ELS
S: Matthew Flatt University of Utah
16:00 - 17:00
EcosystemELS at Paganini
16:00
30m
Talk
Symbols as Namespaces in Common Lisp
ELS
16:30
29m
Talk
Parallelizing Quickref
ELS
Didier Verna EPITA / LRDE
16:59
1m
Talk
Lightning Talks II
ELS