[isabelle] WMM'09 call for papers
Call for Papers
4rd Informal ACM SIGPLAN Workshop on Mechanizing Metatheory
Co-located with ICFP'09.
* Submission deadline: 19 June 2009
* Author Notification: 24 July 2009
* Workshop: 4 September 2009
Researchers in programming languages have long felt the need for tools
to help formalize and check their work. With advances in language
technology demanding deep understanding of ever larger and more complex
languages, this need has become urgent. There are a number of automated
proof assistants being developed within the theorem proving community
that seem ready or nearly ready to be applied in this domain-yet,
despite numerous individual efforts in this direction, the use of proof
assistants in programming language research is still not commonplace:
the available tools are confusingly diverse, difficult to learn,
inadequately documented, and lacking in specific library facilities
required for work in programming languages.
The goal of this workshop is to bring together researchers who have
experience using automated proof assistants for programming language
metatheory, and those who are interested in using tool support for
formalizing their work. One starting point for discussion will be the
obstacles that hinder mechanization (whether they be pragmatic or
technical), and what users and developers can do to overcome them.
The workshop will consist of presentations by the participants, selected
from submitted abstracts. It will focus on providing a fruitful
environment for interaction and presentation of ongoing work.
Participants are invited to submit working notes, source files, and
abstracts for distribution to the attendees, but as the workshop has no
formal proceedings, contributions may still be submitted for publication
elsewhere. (See the SIGPLAN republication policy for more details.)
The scope of the workshop includes, but is not limited to:
* Tool demonstrations: proof assistants, logical frameworks,
* Libraries for programming language metatheory.
* Formalization techniques, especially with respect to binding issues.
* Analysis and comparison of solutions to the POPLmark challenge.
* Examples of formalized programming language metatheory.
* Proposals for new challenge problems that benchmark programming
Email submissions to urbanc AT in.tum.de. Submissions should be no
longer than two pages in PDF and printable on A4 sized paper.
Persons for whom this poses a hardship should contact the program
* Nick Benton, Microsoft Research Cambridge
* Olivier Danvy, University of Aarhus
* Daniel Licata, Carnegie Mellon University
* Francois Pottier, INRIA Paris-Rocquencourt
* Christian Urban, TU Munich (chair)
* Karl Crary, Carnegie Mellon University
* Michael Norrish, National ICT Australia
* Stephanie Weirich, University of Pennsylvania
* Victoria, 2008
* Freiburg, 2007
* Portland, 2006
This archive was generated by a fusion of
Pipermail (Mailman edition) and