Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: Notesfiles $Revision: 1.6.2.17 $; site smu.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxj!ihnp4!inuxc!pur-ee!uiucdcs!smu!leff
From: leff@smu.UUCP
Newsgroups: net.math.symbolic
Subject: Through nfpipe
Message-ID: <35800011@smu.UUCP>
Date: Thu, 4-Oct-84 08:06:00 EDT
Article-I.D.: smu.35800011
Posted: Thu Oct  4 08:06:00 1984
Date-Received: Sat, 6-Oct-84 04:42:36 EDT
Lines: 147
Nf-ID: #N:smu:35800011:000:6262
Nf-From: smu!leff    Oct  4 07:06:00 1984

Although this has appeared in other news groups and in SIGSAM, I thought
it would be appropriate to repost here.

                      Call for Papers

Journal of Symbolic Computation
   computer algebra
   automated theorem proving
   automatic programming
   algorithmic geometry

Academic Press
Subsidiary of Harcourt Brace Jovanovich, Publishers

Editor
B. Buchberger
Johannes Kepler Universitat, A 4040 Linz, Austria

Associate Editors:

W. Bibel, Techische Universitat Munchen, Federal Republic of Germany
J. Cannon Rutgers University, USA
B. F. Caviness, University of Delaware, USA
J. H. Davenport, University of Bath, England
K. Fuchi, ICOT, Japan
G. Huet, INRIA, France
R. Loos, Universitat Karlsruhe, Federal Republic of Germany
Z. Manna, Stanford University, USA
J. Nievergelt, ETH, Switzerland
D. Yun, Southern Methodist University, USA

Editorial Statement:
The Journal of Symbolic Computation aims to provide a forum for research in 
the algorithmic treatment of all types of symbolic objects, i. e. objects in
formal languages (terms, formulae, programs), algebraic objects (elements in
basic number domains, polynomials, residue classes etc.) and geometrical 
objects.  Hence, the main areas covered in the journal are:
. computer algebra
. automated theorem proving
. algorithmic geometry
. automatic programming

All three basic aspects of the algorithmic treatment of symbolic objects
will be included in a balanced way:
. mathematical foundations, correctness and complexity of new (sequential
and parallel) algorithms
. implementations of the algorithms in software systems
. applications of the systems as tools for problem solving in the mathematical
and natural sciences

So far, the above subject areas and the various aspects of these areas have 
been treated in diverse environments and publications.  However, it is 
becoming increasingly clear that these areas share many basic algorithmic
ideas.  In addition, the algorithmic achievements of these areas should
be made available for the human problem solver in integrated software systems
for symbolic computation.  It is the explicit goal of the Journal of Symbolic
Computation to promote the integration of the field of symbolic computation
by establishing one common forum for researchers working in the different
subareas.

Typical topics to be treated in the journal are:
symbolic integration
symbolic summation
symbolic solution of differential equations and of other problems in analysis
term simplification
arithmetic in basic and higher algebraic domains
symbolic solution of equations and systems of equations
computational group theory
computational number theory
computation problems in non-associative and other agebras
algorithmic combinatorics
algorithmic geometry
computational aspects of algebraic geometry
algorithms in coding theory and cryptography
interface between symbolic and numerical algorithms
universal automated theorem proving
unification
automated theorem proving in special theories
automated proof checking
algorithmic proof theory
algorithmic questions in combinatorial logic and lambda calculus
algorithmic logic
automatic program synthesis
automatic program transformation
automatic program verification
symbolic execution of programs
operational semantics of programming languages
algorithmic treatment of abstract data type specifications
interpreters for high-level programs (functional programs, rewrite rule 
  programs, logic programs)
parallel and other special hardware for symbolic computation
design issues of software systems for symbolic computation
programming languages for symbolic computation
description of working software systems
descriptions of typical systems applications
symbolic computation and teaching of mathematics

Information for Contributers:

The Journal of Symbolic Computation will publish original articles on all 
aspects of the algorithmic treatment of symbolic objects(terms, formulae, 
programs, algebraic and geometrical objects).  The emphasis will be on
mathematical foundation, correctness and complexity of new sequential and
parallel algorithms for symbolic computations.  However, the description
of working software systems for symbolic computation and of general new
design principles for symbolic software systems and applications of such
systems for advanced problem solving are also within the scope of the journal.
In addition to original research papers, the Journal of Symbolic Computation
will regularly publish invited tutorial papers on the various subject areas
of symbolic computation and on recent research trends.

Submissions of manuscripts
These should be sent in triplicate to:
B. Buchberger
Journal of Symbolic Computation
Johannes-Kepler-Universitat  Telephone: Austria (732)232381-9219
A4040 Linz, Austria (Europe)  Telex:2-2323 uni li a

Form of manuscripts
An abstract of not more than 200 words should be included.  The introduction
of a paper must contain a clear description of the problem in a form that is 
easily understandable for researchers working in other areas of symbolic
computation.  The introduction should explain the relevance of the problem
in the context of the entire field of symbolic computation.  Also, the
author should explicitly claim which parts of the paper he considers to
be original.  Algorithms must be described in a well structured and system-
independent form such that they are easily read by human readers.  On the
other hand, algorithm descriptions should contain enough details to make
subsequent implementation in a concrete system a routine task.

References
An alphabetical list of references should be included.  Bibliographical
information must be complete.  Only self-explanatory abbreviations should
be used.
The typical form of reference is:
Peterson, G. E. Stickel, M. E. (1981).  Complete sets of reductions for
some equational theories.  J. of the ACM 28/2 233-264.
Citations in the text should be of the form Peter, Stickel (1981).  
Rabin (1980a) etc. should be used when necessary.

More detailed information on the preparation of manuscripts for the journal
is available from the publishers:
ACADEMIC PRESS INC.
A Subsidiary of Harcourt Brace Jovanovich, Publishers
24-28 Oval Road, London NW1 7DX
Telephone 01-267-4466