Nominal/activities/jar09/cfp.html
changeset 415 f1be8028a4a9
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/Nominal/activities/jar09/cfp.html	Wed Mar 30 17:27:34 2016 +0100
@@ -0,0 +1,97 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html>
+<head>
+<title>JAR Special Issue on Binding, Substitution and Naming</title>
+</head>
+
+<body TEXT="#000000" 
+      BGCOLOR="#4169E1" 
+      LINK="#0000EF" 
+      VLINK="#51188E" 
+      ALINK="#FF0000">
+
+<TABLE WIDTH="100%" 
+       BGCOLOR="#4169E1" 
+       BORDER="0"   
+       FRAME="border"  
+       CELLPADDING="10"     
+       CELLSPACING="2"
+       RULES="all">
+
+<TR>
+<TD BGCOLOR="#FFFFFF" 
+    WIDTH="24%" 
+    VALIGN="TOP">
+
+<B>Links</B><BR>
+<A HREF="http://isabelle.in.tum.de/nominal/">Nominal Methods Group</A><br>
+<font color="red">New deadline: November 16, 2009.</font>
+<br><br><br>
+
+
+<A HREF="http://isabelle.in.tum.de/nominal/">
+<IMG SRC="http://isabelle.in.tum.de/nominal/graphics/nominal_logo.gif" ALT="" style="border-width: 0px;" align="left">
+</A>
+
+
+</TD>
+
+
+<TD BGCOLOR="#FFFFFF" WIDTH="75%">
+<H2>Journal of Automated Reasoning</H2>
+
+<H2>Special issue on Binding, Substitution and Naming</H2>
+
+Mathematical treatments of concrete syntax have always been a central
+concern in symbolic computation, programming language implementation
+and computer-aided reasoning. Theories of abstract syntax have proved
+harder to find, especially those addressing properties related to
+substituting structures for variables, binding of names and fresh
+name generation. This special issue is devoted to papers describing
+recent advances in this area. Submissions are encouraged, but not
+limited to, the following topics:
+
+<ul>
+<li> logic-based, categorical or set-based theories of names and binding
+<li> new formalisation techniques for languages involving binders
+<li> applications in programming languages that support binding
+<li> mechanised meta-theory of calculi involving binding and fresh
+     name generation
+<li> logical frameworks, meta-languages and tools that aid reasoning
+     about substitution and binding
+<li> unification for languages involving binders
+</ul>
+
+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 high standards of scholarship and originality
+characteristic of the Journal of Automated Reasoning.
+
+<p>
+Submissions are due <s>October 1, 2009</s>. <font color="red">Extended to November 16, 2009.</font> 
+Papers should be in pdf format following the JAR 
+<A HREF="http://www.springer.com/computer/foundations/journal/10817">guidelines</A>
+for authors.
+
+<p>
+We encourage authors to keep their submissions below 25 pages. Authors
+should submit their papers electronically via 
+<A HREF="http://www.easychair.org/conferences/?conf=taasnjar09"> Easy Chair</A>.
+
+<p>
+Guest Editors:<br>
+Christian Urban and Maribel Fernandez<br>
+(TU Munich, King's College London)<br>
+</TD>
+</TR>
+</table>
+<hr>
+<!-- Created:  Thu Feb 28 19:21:12 CET 2008 -->
+<!-- hhmts start -->
+Last modified: Mon Nov  2 13:19:08 CET 2009
+<!-- hhmts end -->
+<a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
+</body>
+</html>