Application of computer science ideas to the presentation of mathematical theorems and proofs

Authors:
Orit Hazzan
Affiliations:
Technion - Israel Institute of Technology 1 Haifa, Israel
Venue:
ACM SIGCSE Bulletin
Year:
2003

Citing 5
Cited 0

Constructive mathematics and computer programming

Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Social processes and proofs of theorems and programs

Communications of the ACM
Program development by stepwise refinement

Communications of the ACM
The Science of Programming

The Science of Programming
Structure and Interpretation of Computer Programs

Structure and Interpretation of Computer Programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the analogy between mathematical proofs and computer programs this paper illustrates how it is possible to apply methodologies from computer science, used in the development and presentation of computer programs, for the presentation of mathematical theorems and proofs. The following three methodologies are discussed: stepwise refinement, abstraction, and program verification.