Extracting Computer Algebra Programs from Statements

  • Jesús Aransay
  • Clemens Ballarin
  • Julio Rubio
Conference paper

DOI: 10.1007/11556985_21

Volume 3643 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Aransay J., Ballarin C., Rubio J. (2005) Extracting Computer Algebra Programs from Statements. In: Moreno Díaz R., Pichler F., Quesada Arencibia A. (eds) Computer Aided Systems Theory – EUROCAST 2005. EUROCAST 2005. Lecture Notes in Computer Science, vol 3643. Springer, Berlin, Heidelberg

Abstract

In this paper, an approach to synthesize correct programs from specifications is presented. The idea is to extract code from definitions appearing in statements which have been mechanically proved with the help of a proof assistant. This approach has been found when proving the correctness of certain Computer Algebra programs (for Algebraic Topology) by using the Isabelle proof assistant. To ease the understanding of our techniques, they are illustrated by means of examples in elementary arithmetic.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jesús Aransay
    • 1
  • Clemens Ballarin
    • 2
  • Julio Rubio
    • 1
  1. 1.Dpto. de Matemáticas y ComputaciónUniv. de La RiojaLogroñoSpain
  2. 2.Institut für InformatikTechnische UnivMünchen, GarchingGermany