[FOM] Calculemus 2009 CFP

[Jacques Carette]

[The Calculemus Network was recently mentionned on FOM as part of the 
thread on the QED Manifesto]

----------------------------------------
 CALCULEMUS 2009 - Final Call for Papers
----------------------------------------
16th Symposium on the Integration of
Symbolic Computation and Mechanised Reasoning

6-7 July 2009, Joint with CICM'09, Ontario, Canada.

http://www.calculemus.net/meetings/ontario09/
http://www.orcca.on.ca/conferences/cicm09/calculemus09/

Calculemus is a series of conferences dedicated to the integration of
computer algebra systems (CAS) and systems for mechanised reasoning, the
interactive theorem provers or proof assistants (PA) and the automated
theorem provers (ATP).

Currently, symbolic computation is divided into several (more or less)
independent branches: traditional ones (e.g., computer algebra and
mechanised reasoning) as well as newly emerging ones (on user
interfaces, knowledge management, theory exploration, etc.) The main
concern of the Calculemus community is to bring these developments
together in order to facilitate the theory, design, and implementation
of integrated systems for computer mathematics that will routinely be
used by mathematicians, computer scientists and engineers in their every
day business.

We seek original research papers for the upcoming Calculemus meeting,
which will be held jointly with MKM 2009 (confederated in the
Conferences on Intelligent Computer Mathematics, CICM 2009) in Ontario,
Canada.

INVITED TALKS
-------------

We are pleased to have invited talks from:

Prof. Jacques Calmet (http://iaks-www.ira.uka.de/iaks-calmet/en_index.html)

Rob Arthan (Director of Lemma 1, developer of ProofPower, 
http://www.lemma-one.demon.co.uk/Arthan/homepage.html)


TOPICS OF INTEREST
------------------
The scope of Calculemus covers all aspects of the interplay of
mechanised reasoning and computer algebra, including cross-fertilisation
between those two research areas, as well as the development of
integrated systems that transcend both computer algebra and theorem
proving. Potential topics of interest include:

* Theorem proving in computer algebra (CAS)
* Computer algebra in theorem proving (PA and ATP)
* Case studies and applications that both involve computer algebra and
mechanised reasoning
* Representation of mathematics in computer algebra
* Adding computational capabilities to PA and ATP
* Formal methods requiring mixed computing and proving
* Combining methods of symbolic computation and formal deduction
* Mathematical computation in PA and ATP
* Theory, design and implementation of interdisciplinary systems for
computer mathematics
* Infrastructure for mathematical services
* Theory exploration techniques

Papers on other topics closely related to the above research
areas will also be welcomed for consideration.


IMPORTANT DATES
---------------

For (reviewed) full-paper submissions, the deadline are:

Abstract submission: 13 February 2009
Submission deadline: 20 February 2009
Notification of acceptance: 10 April 2009
Camera ready copies due: 24 April 2009

For short papers on emerging trends, the deadline are:

Abstract submission: 30 April 2009
Submission deadline: 7 May 2009
Notification of acceptance: 30 May 2009
Camera ready copies due: 7 June 2009

The dates of the Calculemus conference are: 6,7 July 2009


SUBMISSION
----------
Theoretical and applied research papers on all topics within the scope
of the symposium are invited. Submitted papers (in English) must not
exceed 15 pages in length. The title page should contain the title,
author(s) with affiliation(s), e-mail address(es), listing of keywords
and abstract. The program committee (PC) will subject all submitted
papers to a peer review. Results must be unpublished.

The web page for electronic submission is at:
http://www.easychair.org/conferences/?conf=calculemus2009

The proceedings of the conference will be published as a volume in the
series Lecture Notes in Artificial Intelligence (LNAI) by
Springer-Verlag. Accepted papers will have to be prepared in LaTeX and
formatted according to the requirements of the Springer's LNAI series
(the corresponding style files can be downloaded from
http://www.springer.de/comp/lncs/authors.html and are the same for LNCS
and LNAI).
Proceedings

Accepted papers will be published in the LNAI series of Springer.


PROGRAMME COMMITTEE
-------------------
Markus Aderhold (TU Darmstadt, Germany)
Serge Autexier (DFKI, Germany)
John Campbell (University College London, UK)
Jacques Carette (PC Chair) (McMaster University, Canada)
James H. Davenport (University of Bath, UK)
Louise Dennis (University of Liverpool, UK)
Lucas Dixon (PC Chair) (University of Edinburgh, UK)
William Farmer (McMaster University, Canada)
Jacques Fleuriot (University of Edinburgh, UK)
Herman Geuvers (Radboud University Nijmegen, Netherlands)
Michael Kohlhase (DFKI, Germany)
Steve Linton (University of St. Andrews, UK)
Tomas Recio (Universidad de Cantabria, Spain)
Tom Ridge (University of Cambridge, UK)
Julio Rubio (Universidad de La Rioja, Spain)
Volker Sorge (University of Birmingham, UK)