From mvermaat at cs.vu.nl  Mon Jan 19 10:56:34 2009
From: mvermaat at cs.vu.nl (Martijn Vermaat)
Date: Mon, 19 Jan 2009 16:56:34 +0100
Subject: [POPLmark] Recent solutions to the challenge
Message-ID: <20090119155633.GA4669@cs.vu.nl>

Dear POPLmark readers,

As part of my Master's in Computer Science I'm planning
to do a literature study (~ 1 month of work) on the work
done on the POPLmark Challenge. 

My question is if there is any more recent work than
what is listed on the wiki [1], which does not seem to
be updated for about a year.

Searching through the mailing list archives did not
reveal anything, nor did a search on the web.

Pointers to recent related work (even if not presented
as a direct solution to the challenge) are of course
also appreciated.

kind regards,
Martijn Vermaat

[1] http://alliance.seas.upenn.edu/~plclub/cgi-bin/poplmark/index.php?title=Submitted_solutions

From sweirich at cis.upenn.edu  Fri Jan 30 09:33:32 2009
From: sweirich at cis.upenn.edu (Stephanie Weirich)
Date: Fri, 30 Jan 2009 09:33:32 -0500
Subject: [POPLmark] Journal of Automated Reasoning: Special Issue on the
	POPLmark Challenge
Message-ID: <9D398A3D-2174-4297-B543-04DC03093D6E@cis.upenn.edu>

         Journal of Automated Reasoning

    Special issue on the POPLmark Challenge

                 Call for Papers

How close are we to a world in which mechanically verified software is
commonplace? A world in which theorem proving technology is used
routinely by both software developers and programming language
researchers alike? One crucial step towards achieving these goals is
mechanized reasoning about language metatheory.  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.

In 2005, a group of programming language researchers at Penn and
Cambridge issued "The POPLmark challenge": a set of challenge problems
aimed at the programming language and theorem proving community to
gauge progress in mechanizing programming language metatheory. The
solutions to this challenge have been gathered at

            http://plclub.org/mmm/

The goal of the special issue is a retrospective on the POPLmark
challenge, summarizing and analyzing what has been learned.

Submissions are encouraged, but not limited to, the following topics:

* Complete, polished descriptions of specific POPLmark solutions,
   including well-commented proof scripts

* Analysis and comparison of solutions to the POPLmark challenge

* Descriptions and code for proof assistant extensions/libraries
   developed explicitly for the purpose of programming language
   metatheory

* New formalization techniques, especially with respect to binding
   issues

* Proposals for new challenge problems that benchmark programming
   language work

Manuscripts should be unpublished works and not submitted
elsewhere. Revised and enhanced versions of papers published in
conference proceedings that have not appeared in archival journals
are eligible for submission. All submissions will be reviewed
according to the usual standards of scholarship and originality.

Submissions are due June 15, 2009. We will keep a tight review
schedule to enable publication of the special issue by mid
2010. Papers that do not progress through the reviewing cycle in a
timely manner may be published in a later issue.

Papers should be in pdf format following the JAR guidelines for
authors. We encourage authors to keep their submissions below 30
pages. Authors should submit their papers electronically to
sweirich at cis.upenn.edu.

For more information, see
   http://www.seas.upenn.edu/~sweirich/jar-poplmark/

Guest Editors

   Stephanie Weirich, University of Pennsylvania
   Benjamin Pierce,   University of Pennsylvania