From vaughan2 at seas.upenn.edu Wed Apr 2 17:32:02 2008 From: vaughan2 at seas.upenn.edu (Jeffrey Vaughan) Date: Wed, 02 Apr 2008 17:32:02 -0400 Subject: [POPLmark] Announcement of the Coq Tips wiki Message-ID: <47F3FB52.1030507@seas.upenn.edu> The University of Pennsylvania's Provers group is pleased to announce a new Coq Tips area on the POPLmark wiki. This sub-wiki is intended to collate information relevant to formalizing programming languages in Coq. Currently we index several insightful coq-club archive threads and provide code for some general purpose tactics. In the future we may be interested in merging with another established Coq resource, such as Cocorico. For now, we hope that the Coq Tips wiki will become a valuable resource for those studying programing languages in Coq. Please visit, read, and contribute to the Coq Tips wiki: http://alliance.seas.upenn.edu/~plclub/cgi-bin/poplmark/index.php?title=Coq_tips The University of Pennsylvania Provers Group Brian E. Aydemir, Aaron Bohannon, Nate Foster, Benjamin Pierce, Jeff Vaughan, Dimitris Vytiniotis, Geoff Washburn, Stephanie Weirich, Steve Zdancewic From andreas.abel at ifi.lmu.de Fri Apr 4 11:33:10 2008 From: andreas.abel at ifi.lmu.de (Andreas Abel) Date: Fri, 04 Apr 2008 17:33:10 +0200 Subject: [POPLmark] LFMTP'08: 2nd Call for Papers Message-ID: <47F64A36.2050402@ifi.lmu.de> Update: - invited speaker: Dale Miller - submission server now open (abstract deadline: 14 April) International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'08) http://www4.in.tum.de/~lfmtp Pittsburgh, PA, USA, 23 June 2008 Affiliated with Logic in Computer Science (LICS 2008) 2nd CALL FOR PAPERS Important dates: --------------------------------------------------------------------- Abstract submission: 14 April 2008 Paper submission: 21 April 2008 Author notification: 19 May 2008 Final version: 2 June 2008 Workshop day: 23 June 2008 --------------------------------------------------------------------- The LFMTP workshop continues the International workshop on Logical Frameworks and Meta-languages (LFM) and the MERLIN workshop on MEchanized Reasoning about Languages with variable BIndingIN. Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design and implementation on the one hand and their applications in for example proof-carrying code have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks and variable binding. The broad subject areas of LFMTP'08 are: * The automation and implementation of the meta-theory of programming languages and related calculi, particularly work which involves variable binding and fresh name generation. * The theoretical and practical issues concerning the encoding of variable binding and fresh name generation, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Case studies of meta-programming, and the mechanization of the (meta)theory of descriptions of programming languages and other calculi. Papers focusing on logic translations and on experiences with encoding programming languages theory are particularly welcome. Topics include, but are not limited to * logical framework design * meta-theoretic analysis * applications and comparative studies * implementation techniques * efficient proof representation and validation * proof-generating decision procedures and theorem provers * proof-carrying code * substructural frameworks * semantic foundations * methods for reasoning about logics * formal digital libraries Invited Speaker: Dale Miller (Laboratoire d'Informatique, INRIA Saclay) Program Committee: Andreas Abel (LMU Munich) Peter Dybjer (Chalmers University of Technology) Alberto Momigliano (University of Edinburgh) Brigitte Pientka (McGill University) Randy Pollack (University of Edinburgh) Carsten Schuermann (IT University of Copenhagen) Peter Sewell (University of Cambridge) Aaron Stump (Washington University) Christian Urban (TU Munich) Three categories of papers are solicited: * Category A: Detailed and technical accounts of new research: up to fifteen pages including bibliography. * Category B: Shorter accounts of work in progress and proposed further directions, including discussion papers: up to eight pages including bibliography and appendices. * Category C: System descriptions presenting an implemented tool and its novel features: up to six pages. A demonstration is expected to accompany the presentation. Submission is electronic. Authors are required to submit a paper title and a short abstract of about 100 words before submitting the paper. Papers are to be submitted in postscript or PDF format and must conform to the ENTCS style preferably using LaTeX2e. For further information and submission instructions, see the LFMTP web page: http://www4.in.tum.de/~lfmtp Proceedings are to be published as a volume in the Electronic Notes in Theoretical Computer Science (ENTCS) series and will be available to participants at the workshop. Authors of accepted papers are expected to present their paper at the workshop. The organizers: Andreas Abel Christian Urban Theoretical Computer Science Institute for Computer Science Ludwig-Maximilians-University Munich Technical University of Munich Email: andreas.abel at ifi.lmu.de Email: urbanc at in.tum.de -- Andreas Abel <>< Du bist der geliebte Mensch. Theoretical Computer Science, University of Munich http://www.tcs.informatik.uni-muenchen.de/~abel/ From andreas.abel at ifi.lmu.de Mon Apr 7 05:44:12 2008 From: andreas.abel at ifi.lmu.de (Andreas Abel) Date: Mon, 07 Apr 2008 11:44:12 +0200 Subject: [POPLmark] LFMTP'08: 2nd Call for Papers Message-ID: <47F9ECEC.5020609@ifi.lmu.de> Update: - invited speaker: Dale Miller - submission server now open (abstract deadline: 14 April) International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'08) http://www4.in.tum.de/~lfmtp Pittsburgh, PA, USA, 23 June 2008 Affiliated with Logic in Computer Science (LICS 2008) 2nd CALL FOR PAPERS Important dates: --------------------------------------------------------------------- Abstract submission: 14 April 2008 Paper submission: 21 April 2008 Author notification: 19 May 2008 Final version: 2 June 2008 Workshop day: 23 June 2008 --------------------------------------------------------------------- The LFMTP workshop continues the International workshop on Logical Frameworks and Meta-languages (LFM) and the MERLIN workshop on MEchanized Reasoning about Languages with variable BIndingIN. Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design and implementation on the one hand and their applications in for example proof-carrying code have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks and variable binding. The broad subject areas of LFMTP'08 are: * The automation and implementation of the meta-theory of programming languages and related calculi, particularly work which involves variable binding and fresh name generation. * The theoretical and practical issues concerning the encoding of variable binding and fresh name generation, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Case studies of meta-programming, and the mechanization of the (meta)theory of descriptions of programming languages and other calculi. Papers focusing on logic translations and on experiences with encoding programming languages theory are particularly welcome. Topics include, but are not limited to * logical framework design * meta-theoretic analysis * applications and comparative studies * implementation techniques * efficient proof representation and validation * proof-generating decision procedures and theorem provers * proof-carrying code * substructural frameworks * semantic foundations * methods for reasoning about logics * formal digital libraries Invited Speaker: Dale Miller (Laboratoire d'Informatique, INRIA Saclay) Program Committee: Andreas Abel (LMU Munich) Peter Dybjer (Chalmers University of Technology) Alberto Momigliano (University of Edinburgh) Brigitte Pientka (McGill University) Randy Pollack (University of Edinburgh) Carsten Schuermann (IT University of Copenhagen) Peter Sewell (University of Cambridge) Aaron Stump (Washington University) Christian Urban (TU Munich) Three categories of papers are solicited: * Category A: Detailed and technical accounts of new research: up to fifteen pages including bibliography. * Category B: Shorter accounts of work in progress and proposed further directions, including discussion papers: up to eight pages including bibliography and appendices. * Category C: System descriptions presenting an implemented tool and its novel features: up to six pages. A demonstration is expected to accompany the presentation. Submission is electronic. Authors are required to submit a paper title and a short abstract of about 100 words before submitting the paper. Papers are to be submitted in postscript or PDF format and must conform to the ENTCS style preferably using LaTeX2e. For further information and submission instructions, see the LFMTP web page: http://www4.in.tum.de/~lfmtp Proceedings are to be published as a volume in the Electronic Notes in Theoretical Computer Science (ENTCS) series and will be available to participants at the workshop. Authors of accepted papers are expected to present their paper at the workshop. The organizers: Andreas Abel Christian Urban Theoretical Computer Science Institute for Computer Science Ludwig-Maximilians-University Munich Technical University of Munich Email: andreas.abel at ifi.lmu.de Email: urbanc at in.tum.de -- Andreas Abel <>< Du bist der geliebte Mensch. Theoretical Computer Science, University of Munich http://www.tcs.informatik.uni-muenchen.de/~abel/ From appel at CS.Princeton.EDU Tue Apr 15 14:40:05 2008 From: appel at CS.Princeton.EDU (Andrew W. Appel) Date: Tue, 15 Apr 2008 14:40:05 -0400 Subject: [POPLmark] List machine 2.0 Message-ID: <4804F685.4050305@cs.princeton.edu> The List Machine Benchmark (Appel and Leroy 2006) was introduced as a vehicle for comparing techniques for machine-checked proofs about Typed Assembly Languages. At that time we compared syntactic (progress/preservation) proofs in Coq vs. Twelf. Rob Dockins and I are happy to announce List Machine 2.0 http://www.cs.princeton.edu/~appel/listmachine/2.0/ in which we present a fully worked demonstration in Coq, comparing syntactic (progress/preservation) and semantic (very modal model) proofs of type soundness for a simple Typed Assembly Language. At the moment, although the Coq development is fairly clean and well organized, there is not much documentation. References [1] and [4] on the web site may be helpful, in a general way. -- Andrew Appel From adamc at hcoop.net Wed Apr 16 00:01:40 2008 From: adamc at hcoop.net (Adam Chlipala) Date: Wed, 16 Apr 2008 00:01:40 -0400 Subject: [POPLmark] List machine 2.0 In-Reply-To: <4804F685.4050305@cs.princeton.edu> References: <4804F685.4050305@cs.princeton.edu> Message-ID: <48057A24.7080603@hcoop.net> Andrew W. Appel wrote: > Rob Dockins and I are happy to announce > > List Machine 2.0 > http://www.cs.princeton.edu/~appel/listmachine/2.0/ > > in which we present a fully worked demonstration in Coq, comparing > syntactic (progress/preservation) and semantic (very modal model) proofs > of type soundness for a simple Typed Assembly Language. > I've posted another semantic solution in Coq at: http://adam.chlipala.net/poplmark/listmach_ltamer.tgz My solution is 454 lines (not using anything from the benchmark distribution besides those symbols exported from the [simple_tc_safety] module), including a good amount of type definition/theorem statement boilerplate copied from the definition of the [SIMPLE_TC_SAFETY] signature. Every theorem is proved with a single tactic. This leaves complicated compound tactics as fair game, but rules out brittle proofs that refer to dynamically generated names. I define the meanings of types using the dead obvious logical relation. One of the most tiresome parts of working with the formalization in [Machine] was that it forced me to think about step counts too much. I've found that co-inductive semantics hide all of that nitty-gritty nicely. It would also be nice to remove the need to prove determinism of the step relation explicitly by making [step] a function. Here I'm just trying to transfer what I've found to work well with higher-level languages, but I haven't seen any reason yet to doubt that the same approach won't transfer well to assembly language. From vaughan2 at seas.upenn.edu Fri Apr 18 15:14:44 2008 From: vaughan2 at seas.upenn.edu (Jeffrey Vaughan) Date: Fri, 18 Apr 2008 15:14:44 -0400 Subject: [POPLmark] PL in Coq Survey Message-ID: <4808F324.9050006@seas.upenn.edu> Hello, We in the Penn Provers group are assembling a list of all the groups currently using Coq to formalize programming languages theory. If that's you, please send us a message (care of Jeff Vaughan, vaughan2/@/seas.upenn.edu) with a sentence or two about what you're doing and any relevant URLs. Also, please let us know if it's *not* okay for us to repost your project description on our wiki. Thank you! Benjamin Pierce, Jeff Vaughan, Stephanie Weirich, and Steve Zdancewic for the The University of Pennsylvania Provers Group From crary at cs.cmu.edu Tue Apr 22 20:48:58 2008 From: crary at cs.cmu.edu (Karl Crary) Date: Tue, 22 Apr 2008 20:48:58 -0400 Subject: [POPLmark] WMM'08 call for papers Message-ID: <480E877A.8050306@cs.cmu.edu> Apologies for the cross-posting. ----------------------------------------- Call for Papers 3rd Informal ACM SIGPLAN Workshop on Mechanizing Metatheory Victoria, British Columbia, Canada Sponsored by ACM SIGPLAN Co-located with ICFP?08. http://www.cis.upenn.edu/~sweirich/wmm/ Important Dates * Submission deadline: 3 July 2008 * Author Notification: 1 August 2008 * Workshop: 20 September 2008 Workshop Description 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 mechanisation (whether they be pragmatic or technical), and what users and developers can do to overcome them. Format 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.) Scope The scope of the workshop includes, but is not limited to: * Tool demonstrations: proof assistants, logical frameworks, visualizers, etc. * 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 language work. Submission Guidelines Email submissions to crary AT cs.cmu.edu. Submissions should be no longer than one page and in PDF and printable on US Letter or A4 sized paper. Persons for whom this poses a hardship should contact the program chair. Conference Organization Program Committee * Adam Chlipala, Jane Street Capital * Karl Crary, Carnegie Mellon University (chair) * Carsten Schuermann, IT University Copenhagen * Aaron Stump, Washington University in St. Louis * Christian Urban, TU Munich Workshop Organizers * Michael Norrish, National ICT Australia * Stephanie Weirich, University of Pennsylvania * Steve Zdancewic, University of Pennsylvania Previous Workshops * Freiburg, 2007 * Portland, 2006