European Lisp Symposium

The conference is over!


  • Julia - To Lisp or not to Lisp

    • Stefan Karpinski Stefan Karpinski (SPEAKER)

    Julia is a general purpose dynamic language, designed to make numerical computing fast and convenient. Many aspects of Julia should be quite familiar since they are "stolen" straight from Lisp: it’s expression-oriented, lexically scoped, has closures, coroutines, and macros that operate on code as data. But Julia departs from the Lisp tradition in other ways. Julia has syntax – lots of it. Macro invocations look different than function calls. Some dynamic behaviors are sacrificed to make programs easier to analyze (for both humans and compilers), especially where it allows simpler, more reliable program optimization. Julia’s most distinctive feature is its emphasis on creating lightweight types and defining their behavior in terms of generic functions. While many Lisps support multiple dispatch as an opt-in feature, in Julia all function are generic by default. Even basic operators like `+` are generic, and primitive types like `Int` and `Float64` are defined in the standard library, and their behavior is specified via multiple dispatch. A combination of aggressive method specialization, inlining and data-flow-based type inference, allow these layers of abstraction and dispatch to be eliminated when it counts – Julia generally has performance comparable to static languages. In the tradition of the great Lisp hackers, this talk will include lots of live coding in the REPL, with all the excitement, and possibility of failure entailed.

  • Lexical Closures and Complexity

    • Francis Sergeraert Francis Sergeraert Institut Fourier (SPEAKER)

    The power of Common Lisp for Functional_Programming is well known, the key tool being the notion of "lexical closure", allowing the programmer to write programs which, during execution, dynamically generate functional objects of arbitrary complexity. Using this technology, new algorithms in Algebraic Topology have been discovered, implemented in Common Lisp and used, producing homology and homotopy groups so far unreachable. An algorithm is viewed as "tractable" if its theoretical complexity is not worse than polynomial. The study of this complexity for the aforementioned of Algebraic Topology algorithms requires a lucid knowledge of the concrete implementation of these lexical closures. This talk is devoted to a report about a result of polynomial complexity so obtained. The scope of the method is general and in particular no knowledge in Algebraic Topology is expected from the audience.


photo Dept. of Computer Science, AGH University of Science and Technology (CONFERENCE)
Kawiory 21
Kraków 30-055 Poland



Programme Chair

  • Irène Durand Irène Durand LaBRI, University of Bordeaux (PROGRAMME-CHAIR) France

Local Chair

  • Michał Psota Michał Psota Emergent Network Defense (LOCAL-CHAIR) Kraków Poland


  • Antonio Leitao Antonio Leitao INESC-ID / Instituto Superior Técnico, Universidade de Lisboa (COMMITTEE) Portugal
  • Charlotte Herzeel Charlotte Herzeel IMEC (COMMITTEE) Leuven Belgium
  • Christian Queinnec Christian Queinnec University Pierre et Marie Curie (COMMITTEE) Paris 6 France
  • Christophe Rhodes Christophe Rhodes Goldsmiths, University of London (COMMITTEE) UK
  • Erick Gallesio Erick Gallesio University of Nice-Sophia Antipolis (COMMITTEE) France
  • François-René Rideau François-René Rideau Google (COMMITTEE SPEAKER) USA
  • Giuseppe Attardi Giuseppe Attardi University of Pisa (COMMITTEE) Italy
  • Kent Pitman Kent Pitman HyperMeta Inc. (COMMITTEE) USA
  • Leonie Dreschler-Fischer Leonie Dreschler-Fischer University of Hamburg (COMMITTEE SPEAKER) Germany
  • Pascal Constanza Pascal Constanza Intel Corporation (COMMITTEE) Belgium
  • Robert Strandh Robert Strandh University of Bordeaux (COMMITTEE SPEAKER) France


Times are local to the conference. You can download the programme in iCalendar format here.
  1. May 8th

  2. Welcome reception, pre-registration

  3. May 9th

  4. Registration

  5. Welcome Message

  6. Lexical Closures and Complexity

    • Francis Sergeraert
  7. Coffee

  8. Refactoring Dynamic Languages

    • Rafael Reia
    • António Leitão
  9. Type-Checking of Heterogeneous Sequences in Common Lisp

    • Jim Newton
    • Akim Demaille
    • Didier Verna
  10. A CLOS Protocol for Editor Buffers

    • Robert Strandh
  11. Lunch

  12. Using Lisp Macro-Facilities for Transferable Statistical Tests

    • Kay Hamacher
  13. A High-Performance Image Processing DSL for Heterogeneous Architectures

    • Kai Selgrad
    • Alexander Lier
    • Jan Dörntlein
    • Oliver Reiche
    • Marc Stamminger
  14. Coffee

  15. Distributed High Performance Computing in Common Lisp

    • Marco Heisig
    • Nicolas Neuss
  16. Fast Interactive Functional Computer Vision with Racket

    • Benjamin Seppke
    • Leonie Dreschler-Fischer
  17. Accessing local variables during debugging

    • Michael Raskin
    • Nikita Mamardashvili
  18. Lightning Talks

  19. May 10th

  20. Julia - To Lisp or not to Lisp

    • Stefan Karpinski
  21. Coffee

  22. A modern implementation of the LOOP macro

    • Robert Strandh
  23. Source-to-Source Compilation via Submodules

    • Tero Hasu
    • Matthew Flatt
  24. Extending Software Transactional Memory in Clojure with Side-Effects and Transaction Control

    • Søren Jensen
    • Lone Thomsen
  25. Lunch

  26. CANDO: A Compiled Programming Language for Computer-Aided Nanomaterial Design and Optimization Based on Clasp Common Lisp

    • Christian Schafmeister
  27. A Case Study in Implementation-Space Exploration

    • Alexander Lier
    • Linus Franke
    • Marc Stamminger
    • Kai Selgrad
  28. Coffee

  29. An Inferred System Description Facility

    • James Anderson
  30. Building Common Lisp programs using Bazel

    • James Knight
    • François-René Rideau
    • Andrzej Walczak
  31. Lightning Talks

  32. Conference End

  33. Conference Dinner


You can find the proceedings in PDF form here: