[Haskell] Call for Talk Proposals: Parsing at SLE

[Sebastian Erdweg]

*********************************************************************
CALL FOR TALK PROPOSALS

Second Workshop on 
Parsing at SLE 2014

September 14, 2014
Västerås, Sweden
Co-located with ASE, SLE, and GPCE

http://www.sleconf.org/2014/Parsing-at-SLE.html
*********************************************************************

Deadline for talk proposals: July 25, 2014

The goal of this workshop is to bring together today's experts in the fields of
parser construction and parser application from across the diverse application
areas. Participants will present ongoing work as well as explore the challenges
that lie ahead. By bringing the whole community together (a rare occurrence,
given the diversity of domain-specific conferences/workshops), we aim to forge
new collaborations inspired by a wide-ranging collection of talks on
parsing-related topics.

*** Topics ***

While parsing and parser generation, both in theory and in practice, are mature
topics, there are challenging problems with respect to the construction,
maintenance, optimization, and application of parsers in real-world scenarios.

Especially in the context of real programming languages there are ample
theoretical as well as practical obstacles to be overcome. Contemporary parsing
challenges are caused by programming-language evolution and diversity in the
face of new application areas such as IDE construction, reverse engineering,
software metrics, domain specific (embedded) languages, etc. What are modular
meta-formalisms for parser generation? How to obtain (fast and correct) parsers
for both legacy and new languages that require more computational power than
context-free grammars and regular expressions can provide? How to enable the
verified construction or prototyping of parsers for languages such as COBOL, C++
and Scala without years of effort?

In addition to the traditional programming-language applications of parsing
technology, several other areas of computing also depend heavily on
parsers. Examples include computational linguistics, network traffic
classification, network security, and bioinformatics. Those areas often have
their own unusual requirements, such as: speed (e.g. in network algorithmics),
memory efficiency (e.g. embedded devices for networks, but also computational
linguistics), or rapid/dynamic parser construction (e.g. in network traffic
classification and in bioinformatics) as grammars are adapted. We specifically
encourage talk proposals on parsing challenges and solutions in these
non-traditional areas.

*** Call for Submissions ***

We solicit talk proposals in the form of short abstracts (max. 2 pages in ACM
2-column format). A good talk proposal describes an interesting position,
demonstration, or early achievement. The submissions will be reviewed on
relevance and clarity, and used to plan the mostly interactive sessions of the
workshop day. Publication of accepted abstracts and slides on the website is
voluntary.

* Deadline for talk proposals: July 25, 2014
* Workshop: September 14, 2014
* Notification: August 6, 2014
* Submission website: https://www.easychair.org/conferences/?conf=parsingsle2014

*** Workshop Organization ***

Organizers

* Sebastian Erdweg, TU Darmstadt, Germany
* Bruce Watson, FASTAR, Stellenbosch University, South Africa