JAR Special Issue on Binding, Substitution and Naming

Links Nominal Methods Group New deadline: November 16, 2009. | ## Journal of Automated Reasoning ## Special issue on Binding, Substitution and Naming 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: logic-based, categorical or set-based theories of names and binding new formalisation techniques for languages involving binders applications in programming languages that support binding mechanised meta-theory of calculi involving binding and fresh name generation logical frameworks, meta-languages and tools that aid reasoning about substitution and binding unification for languages involving binders 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. Submissions are due October 1, 2009. Extended to November 16, 2009. Papers should be in pdf format following the JAR guidelines for authors. We encourage authors to keep their submissions below 25 pages. Authors should submit their papers electronically via Easy Chair. Guest Editors: Christian Urban and Maribel Fernandez (TU Munich, King's College London)

Last modified: Mon Nov 2 13:19:08 CET 2009 [Validate this page.]