Symbolic Computation Software Composability

  • Authors:
  • Sebastian Freundt;Peter Horn;Alexander Konovalov;Steve Linton;Dan Roozemond

  • Affiliations:
  • Fakultät II - Institut für Mathematik, Technische Universität Berlin, Berlin, Germany;Fachbereich Mathematik, Universität Kassel, Kassel, Germany;School of Computer Science, University of St Andrews, Scotland;School of Computer Science, University of St Andrews, Scotland;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Netherlands

  • Venue:
  • Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present three examples of the composition of Computer Algebra Systems to illustrate the progress on a composability infrastructure as part of the SCIEnce (Symbolic Computation Infrastructure for Europe) project. One of the major results of the project so far is an OpenMath based protocol called SCSCP(Symbolic Computation Software Composability Protocol). SCSCPenables the various software packages for example to exchange mathematical objects, request calculations, and store and retrieve remote objects, either locally or accross the internet. The three examples show the current state of the GAP, KANT, and MuPAD software packages, and give a demonstration of exposing Macaulay using a newly developed framework.