coq-club AT inria.fr

Subject: The Coq mailing list

List archive

[Coq-Club] Rewriting Calculi and Higher-Order Reductions - special issue of MSCS

From: Horatiu Cirstea <Horatiu.Cirstea AT loria.fr>
To: acl2 AT cs.utexas.edu, aiia AT di.unito.it, ALP-request AT NIC.SURFNET.NL, als+lics-request AT dcs.ed.ac.uk, caml-list AT pauillac.inria.fr, ccl AT dfki.uni-sb.de, curry AT informatik.rwth-aachen.de, ccl AT ps.uni-sb.de, ccp AT sics.se, colibri AT let.uu.nl, comlab AT comlab.ox.ac.uk, compulognet-parimp AT dia.fi.upm.es, coq-club AT pauillac.inria.fr, cs-logic AT cs.indiana.edu, eacsl AT dimi.uniud.it, eapls AT jiscmail.ac.uk, elan-users AT loria.fr, frocos AT loria.fr, haskell AT haskell.org, ifip AT ifip.or.at, lfg AT lists.stanford.edu, lpnmr AT cs.engr.uky.edu, ml AT ics.uci.edu, mrg AT itc.it, nlp-ia AT bosoleil.ci.umoncton.ca, prog-lang AT daimi.au.dk, prog-lang AT diku.dk, rewriting AT ens-lyon.fr, sigparse-list AT CS.CMU.EDU, sigparse-list AT nl.cs.cmu.edu, softtech AT cs.uu.nl, stratego AT cs.uu.nl, theory-logic AT CS.CMU.EDU, theorynt AT listserv.nodak.edu, types AT cis.upenn.edu, types-wg AT durham.ac.uk
Cc: editors-rho AT loria.fr
Subject: [Coq-Club] Rewriting Calculi and Higher-Order Reductions - special issue of MSCS
Date: Thu, 1 Sep 2005 17:44:29 +0200
List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>

                        CALL FOR PAPERS

      Mathematical Structures in Computer Science,
                      Special Issue on

       Rewriting Calculi and Higher-Order Reductions

Following from the success of the workshops on rewriting calculus,
there will be a special issue of the journal Mathematical Structures
in Computer Science (MSCS, Cambridge University Press) on
Rewriting Calculi and Higher-Order Reductions. Submissions for
this special issue are hereby solicited.

The integration of first-order and higher-order paradigms has been one
of the main problems raised since the beginning of the study of
programming language semantics and of proof environments. This has
been handled either by enriching first-order rewriting with
higher-order capabilities or by adding to lambda-calculus algebraic
features.

The rewriting calculus has been introduced as a general means to
uniformly integrate rewriting and lambda calculus. This calculus makes
explicit and first-class all of its components: matching (possibly
modulo given theories), abstraction, application and substitutions.
The rewriting calculus is designed and used for logical and semantical
purposes. It could be used with powerful type systems and for
expressing the semantics of rule based as well as object oriented
paradigms. It allows one to naturally express exceptions and
imperative features as well as expressing elaborated rewriting
strategies.

This special issue of the MSCS will be devoted to the foundations of
the rewriting calculus and of related systems combining matching and
higher-order features.  Topics for the special issue include, but are
not limited to, the following aspects of these calculi:
- operational semantics,
- type systems,
- models,
- associated logics,
- implementation issues,
- applications.

Submissions should be sent electronically to
rho-editors AT loria.fr
by
15th January 2006 (all submissions will be  acknowledged). Information
about the journal, including style files, can be found at:

http://www.cambridge.org/uk/journals/journal_ifc.asp?mnemonic=MSC

Submissions will be refereed according to the usual very high
standards of MSCS. Horatiu Cirstea and Maribel Fernandez will serve as
guest editors for this special issue. Final decisions on editorial
matters rest with the editor-in-chief of MSCS.

[Coq-Club] Rewriting Calculi and Higher-Order Reductions - special issue of MSCS, Horatiu Cirstea