Results 1 
2 of
2
Structured Calculational Proof
, 1996
"... We propose a new format for writing proofs, which we call structured calculational proof. The format is similar to the calculational style of proof already familiar to many computer scientists, but extends it by allowing large proofs to be hierarchically decomposed into smaller ones. In fact, struc ..."
Abstract

Cited by 16 (9 self)
 Add to MetaCart
(Show Context)
We propose a new format for writing proofs, which we call structured calculational proof. The format is similar to the calculational style of proof already familiar to many computer scientists, but extends it by allowing large proofs to be hierarchically decomposed into smaller ones. In fact, structured calculational proof can be seen as an alternative presentation of natural deduction. Natural deduction is a well established style of reasoning which uses hierarchical decomposition to great effect, but which is traditionally expressed in a notation that is inconvenient for writing calculational proofs. The hierarchical nature of structured calculational proofs can be used for proof browsing. We comment on how browsing can increase the value of a proof, and discuss the possibilities offered by electronic publishing for the presentation and dissemination of papers containing browsable proofs. Note: This paper is also available as Australian National University Joint Computer Science Tec...
A Browsable Format for Proof Presentation
 Mathesis Universalis
, 1996
"... The paper describes a format for presenting proofs called structured calculational proof. The format resembles calculational proof, a style of reasoning popular among computer scientists, but extended with structuring facilities. A prototype tool has been developed which allows readers to interacti ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
(Show Context)
The paper describes a format for presenting proofs called structured calculational proof. The format resembles calculational proof, a style of reasoning popular among computer scientists, but extended with structuring facilities. A prototype tool has been developed which allows readers to interactively browse proofs presented in this format via the world wide web. The ability to browse a proof increases its readability, and hence its value as a proof. Computers have been used for some time to both construct and check mathematical proofs, but using them to enhance the readability of proofs is a relatively novel application. This paper was originally presented at the symposium on Logic, Mathematics and the Computer The reference is as follows: Jim Grundy. A browsable format for proof presentation. In Christoffer Gefwert, Pekka Orponen and Jouko Seppanen (editors), Logic, Mathematics and the Computer  Foundations: History, Philosophy and Applications, volume 14 of the Finnish Artifi...