Structured calculational proof
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...[Show more]
|Collections||ANU Research Publications|
|1595-01.2003-07-03T03:50:33Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-96-09.pdf||117.6 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.