European Lisp Symposium

• LISPWORKS
• FRANZ
• CLOZURE
• GOLDSMITHS
• ITA

Highlights

• Escaping the Heap

  • Ahmon Dancy Ahmon Dancy Franz Inc. (SPEAKER)

  Common Lisp implementations provide great automatic memory management of data structures. These data structures are allocated from a memory area called the “heap”. However, there are times when heap allocation is inadequate to satisfy the needs of the application. For example, sometimes data structures need to be persistent or shareable amongst separate processes. In these cases, alternatives to using the heap must be considered. In this talk we will explore the motivations for out-of-heap data structures. We will discuss some of the out-of-heap data structures that we’ve created in the course of developing our database product, such as lists, hash tables, and arrays. We will describe the tools and mechanisms that we used to implement them, including memory-mapped files, foreign structs, aligned pointers and direct memory accesses. Finally we will discuss the downsides of out-of-heap data structures and the constant struggle between abstractions and performance.

• Quicklisp: On Beyond Beta

  • Zach Beane Zach Beane Clozure Associates (SPEAKER)

  Quicklisp was released in 2010 as a public beta. Five years later, it's still in beta. How has Quicklisp (and Common Lisp) evolved in the past five years? What will it take for Quicklisp to go on beyond beta?

• Unwanted memory retention

  • Martin Cracauer Martin Cracauer Google (SPEAKER)

  This talk goes over numerous oddities in a Lisp-based system which led to unwanted heap memory retention and to constant resident memory growth over the uptime of the system. Issues covered include a mostly conservative but also paged garbage collector, the difficulty of clearing out data structures that are retainted as an optimization but that might hold on to large amounts of heap (and how that happens in C++, too) and how large intercollected and theoretically uprooted "clouds of heap debris" interact with stale pointers out of same. The most delicious pieces center around pointer staleness out of the saved (on-disk, but read-write mapped) part of the heap, which is not garbage collected, into anonymous memory backed heap and how you can create rootless but uncollected and "untraceable" object circles. Untraceable until you hack up the GC to help you.

• µKanren: Running the Little Things Backwards

  • Bodil Stokke Bodil Stokke (SPEAKER)

  Relational programming, or logic programming, is a programming paradigm that exhibits remarkable and powerful properties, to the extent that its implementation seems frightfully daunting to the layman. µKanren is a minimal relational language that seeks to strip the paradigm down to its core, leaving us with a succinct, elegant and above all simple set of primitives on top of which we can rebuild even the most powerful relational constructs. In this talk, we will explore the µKanren language by implementing it from first principles in a simple functional programming language, going on to demonstrate how you can assemble these simple building blocks into a semblance of its richer parent, miniKanren, and maybe solve a logic puzzle or two to make sure it’s working as advertised.

Location

Goldsmiths, University of London http://www.gold.ac.uk/ (CONFERENCE) New Cross SE14 6NW London United Kingdom

Organization

Programme Chair

• Julian Padget Julian Padget University of Bath (PROGRAMME-CHAIR) UK

Organizing Chair

• Didier Verna Didier Verna https://www.lrde.epita.fr/~didier/ EPITA / LRE (ORGANIZING-CHAIR) France

Local Chair

• Christophe Rhodes Christophe Rhodes Goldsmiths University of London (LOCAL-CHAIR) UK

Committee

• Christian Queinnec Christian Queinnec University Pierre et Marie Curie (COMMITTEE) Paris 6 France
• Edmund Weitz Edmund Weitz University of Applied Sciences (COMMITTEE) Hamburg Germany
• Giuseppe Attardi Giuseppe Attardi University of Pisa (COMMITTEE) Italy
• Henry Liebermann Henry Liebermann MIT (COMMITTEE) USA
• Marc Freely Marc Freely University of Montreal (COMMITTEE) Canada
• Matthew Flatt Matthew Flatt University of Utah (COMMITTEE) USA
• Nick Levine Nick Levine RavenPack (COMMITTEE) Spain
• Rainer Joswig Rainer Joswig (COMMITTEE) Hamburg Germany
• Robert Strandh Robert Strandh University of Bordeaux (COMMITTEE SPEAKER) France
• Sacha Chua Sacha Chua (COMMITTEE) Toronto Canada
• Stephen Eglen Stephen Eglen University of Cambridge (COMMITTEE) UK

Programme

1. 0:00

   April 20th

2. 8:30

   Registration

3. 9:00

   Welcome Message

4. 9:30

   Quicklisp: On Beyond Beta

   • Zach Beane
5. 10:30

   Coffee

6. 11:00

   Efficient Applicative Programming Environments for Computer Vision Applications

   • Benjamin Seppke
   • Leonie Dreschler-Fischer
7. 11:30

   Keyboard? How quaint. Visual Dataflow Implemented in Lisp

   • Donald Fisk
8. 12:00

   P2R - Implementation of Processing in Racket

   • Hugo Correia
   • António Leitão
9. 12:30

   Lunch

10. 14:30

    Constraining application behaviour by generating languages

    • Paul van der Walt
11. 15:00

    Processing List Elements in Reverse Order

    • Irène Durand
    • Robert Strandh
12. 15:30

    Executable Pseudocode for Graph Algorithms

    • Breanndán Ó Nualláin
13. 16:00

    Coffee

14. 16:30

    Unwanted memory retention

    • Martin Cracauer
15. 17:30

    Lightning Talks

16. 18:00

17. 19:30

    Conference Dinner

18. 0:00

    April 21st

19. 9:30

    A Gentle Introduction to Gendl, a Common Lisp-based Knowledge Based Engineering Environment

    • Dave Cooper
20. 11:00

    Coffee

21. 11:30

    lambdatalk

    • Alain Marty
22. 12:00

    Symbolic Pattern Matching in Clojure

    • Simon Lynch
23. 12:30

    Escaping the Heap

    • Ahmon Dancy
24. 13:00

    Lunch

25. 14:30

    µKanren: Running the Little Things Backwards

    • Bodil Stokke
26. 15:30

    Coffee

27. 16:00

    Woo: a fast HTTP server for Common Lisp

    • Eitaro Fukamachi
28. 16:30

    Clasp: Common Lisp+LLVM+C++

    • Christian Schafmeister
29. 17:00

    Quantum Physics Simulations in Common Lisp

    • Miroslav Urbanek
30. 17:30

    First-class Global Environments in Common Lisp

    • Robert Strandh
31. 18:00

    Lightning Talks

32. 18:30

    Conference End