Dyla'14 at PLDI, Edinburgh, UK

SCHEDULE

Typed Lua: An Optional Type System for Lua

Andre Murbach Maidl, Fabio Mascarenhas and Roberto Ierusalimschy.

Meta-tracing makes a fast Racket

Carl Friedrich Bolz, Tobias Pape, Jeremy Siek and Sam Tobin-Hochstadt.

Debugging at Full Speed

Chris Seaton, Michael L. Van De Vanter and Michael Haupt.

I Know It When I See It: Observable Races in JavaScript Applications

Erdal Mutlu, Serdar Tasiran and Benjamin Livshits.

Python Interpreter Performance Deconstructed

Gergö Barany.

List-based Monadic Computations for Dynamically Typed Languages

Wim Vanderbauwhede.

The advent of Java and C# has been a major breakthrough in the adoption of some important object-oriented language characteristics. This breakthrough turned academic features like interfaces, garbage collection, and meta-programming into technologies generally accepted by industry. Nevertheless, the massive adoption of these languages now also gives rise to a growing awareness of their limitations. A number of reactions from industry testify this: invokedynamic bytecode instruction has been included in latest Java virtual machine release; the dynamic language runtime (DLR) is gaining popularity; C# adopted dynamic as a valid static type. Gartner prognoses further growth of dynamic languages.

Researchers and practitioners struggle with static type systems, overly complex abstract grammars, simplistic concurrency mechanisms, limited reflection capabilities, and the absence of higher-order language constructs such as delegation, closures and continuations. Dynamic languages such as Ruby, Python, JavaScript and Lua are a step forward as a solution to these problems and are getting more and more popular. Pushing these languages to mainstream requires practitioners to look back and pick up what is out there in existing dynamic languages such as Lisp, Scheme, Smalltalk and Self. Practitioners also need to further explore the power of future dynamic language constructs in the context of new challenging fields such as cloud computing, big data processing, and internet of things.

The goal of this workshop is to act as a forum where practitioners can discuss new advances in the design, implementation and application of dynamically typed languages that, sometimes radically, diverge from the statically typed class-based mainstream. Another objective of the workshop is to discuss new as well as older "forgotten" languages and features in this context. Topics of interest include, but are not limited to:

• programming language extensions
• programming environment extensions
• executing environments
• static and dynamic analyses
• optional type-checking
• meta-object protocols
• reverse engineering
• domain-specific languages/tooling
• testing environments
• live programming

The expected audience of this workshop includes practitioners and researchers sharing the same interest in dynamically typed languages. Lua, Python, Ruby, Scheme and Smalltalk are gaining a significant popularity both in industry and academia. Nevertheless, each community has the tendency to only look at what it produces. Broadening the scope of each community is the goal of the workshop. To achieve this goal we will form a PC with leading persons from all languages mentioned above, fostering participation from all targeted communities.

The workshop will have a demo-oriented style. The idea is to allow participants to demonstrate new and interesting features and discuss what they feel is relevant for the dynamic-language community. To participate in the workshop, you can either

• submit (before March 17th 2014) an article (ACM Tighter Alternate style) describing your presentation and/or tool. Your article, which must include from 2 to 15 pages, will be carefully reviewed by the program committee. If accepted, your article will be presented during the workshop and be published to the ACM Digital Library (at your option) and the workshop's web site. Please submit to http://www.easychair.org/conferences/?conf=dyla14.
• or give a 10-minute lightning demo of your work. A dedicated session will be allocated for this, provided there is ample time available. In this case, send us the title of your demo.

A session on pair programming is also planned. People will then get a chance to share their technologies by interacting with other participants.

• Submission: March 17th (was March 15th)
• Notification: end of March
• Workshop: June 12th

• Anne Etien, University Lille 1, FR
• David Schneider, Heinrich-Heine-Universität Düsseldorf, DE
• Didier Verna, EPITA/LRDE, FR
• Edd Barrett, King's College London, GB
• Joe Gibbs Politz, Brown University, US
• Peng Wu, IBM T.J. Watson Research Center, US
• T. Stephen Strickland, University of Maryland, US
• Tim Felgentreff, Hasso-Plattner-Institut, DE
• Yoshiki Ohshima, Viewpoints Research Institute, US
• Zachary P. Beane, Portland, US
• the 5 workshop organizers

Contact us at dyla@inria.fr.

• Damien Cassou, University of Lille 1, FR
• Carl Friedrich Bolz, King's College London, GB
• Tom Van Cutsem, Vrije Universiteit Brussel, BE
• Johan Andersson, Burtcorp in Gothenburg, SE
• Roberto Ierusalimschy, Catholic University in Rio de Janeiro, BR