Extracting computer algebra programs from statements

Authors:
Jesús Aransay;Clemens Ballarin;Julio Rubio
Affiliations:
Dpto. de Matemáticas y Computación, Univ. de La Rioja, Logroño, Spain;Institut für Informatik, Technische Univ, München, Garching, Germany;Dpto. de Matemáticas y Computación, Univ. de La Rioja, Logroño, Spain
Venue:
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Year:
2005

Citing 5
Cited 2

Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
A Comparison of Mizar and Isar

Journal of Automated Reasoning
Markov's Principle for Propositional Type Theory

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Program extraction in simply-typed higher order logic

TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

Mechanized reasoning in Homological Algebra

AI Communications
ACL2 Verification of Simplicial Degeneracy Programs in the Kenzo System

Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.