On the desirability of mechanizing calculational proofs

Citation
P. Manolios et Js. Moore, On the desirability of mechanizing calculational proofs, INF PROCESS, 77(2-4), 2001, pp. 173-179
Citations number
28
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
INFORMATION PROCESSING LETTERS
ISSN journal
00200190 → ACNP
Volume
77
Issue
2-4
Year of publication
2001
Pages
173 - 179
Database
ISI
SICI code
0020-0190(20010228)77:2-4<173:OTDOMC>2.0.ZU;2-L
Abstract
Dijkstra argues that calculational proofs are preferable to traditional pic torial and/or verbal proofs. First, due to the calculational proof format, incorrect. proofs are less likely. Second, syntactic considerations (lettin g the "symbols do the work") have led to an impressive array of techniques for elegant proof construction. However, calculational proofs are not forma l and are not flawless. Why not make them formal and check them mechanicall y? (C) 2001 Elsevier Science B.V. All rights reserved.