Abstract
We propose a new format for writing proofs, calledstructured calculational proof. The format resembles the calculational style already familiar to many computer scientists, but extends it to allow the hierarchical decomposition of larger proofs into smaller ones. Structured calculation is actually an alternative presentation of natural deduction, a 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 browsing proofs in electronic publications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Back, R.-J. R. and von Wright, J.:Refinement Calculus: A Systematic Introduction. Springer, Berlin, 1998.
Dijkstra, E. W. and Scholten, C. S.:Predicate Calculus and Program Semantics, Texts and Monographs in Comput. Sci. Springer, New York, 1990.
Grundy, J., Back, R.-J. R., and von Wright, J.: Structured Solutions to the 1995 Finnish Highschool General Mathematics Matriculation Exam. URL: http://www.abo.fi/∼jwright/schoolmath/MatricExamples/.
Gentzen, G.: Untersuchungen über das logische Schliessen [Investigations into Logical Deduction].Math. Zeitschrift, 39, 176–210, 405–431 (1935). Translated in Szabo [Sza69], pp. 68–131.
Gries, D.: Teaching Calculation and Discrimination: A More Effective Curriculum.Commun. ACM, 34, 45–54 (1991).
Grundy, J.: A Browsable Format for Proof Presentation.Math. Universalis, 2 (1996). URL: http://www.pip.com.pi/MathUniversalis/2/grundy/mu.html.
Grundy, J.: Transformational Hierarchical Reasoning.Comput. J., 39, 291–302 (1996).
Hehner, E. C. R.:A Practical Theory of Programming. Springer, New York, 1993.
Lamport, L.: How to Write a Proof.American Math. Monthly, 102, 600–608 (1995).
Norvell, T. S.: Induce-Statements and Induce-Expressions: Constructs for Inductive Programming. In Shyamasundar, R. K. (ed.),Proc. 13th Conf. on Foundations of Softw. Technology and Theoretical Comput. Sci, LNCS, 761, pp. 294–305, Springer, 1993.
Prawitz, D.:Natural Deduction: A Proof-Theoretic Study, Stockholm Studies in Philo., 3, Almqvist & Wiksell, Stockholm, 1965.
Robinson, P. J. and Staples, J.: Formalizing a Hierarchical Structure of Practical Mathematical Reasoning.J. Logic Comput., 3, 47–61 (1993).
Szabo, M. E. (ed.):The Collected Papers of Gerhard Gentzen, Studies in Logic and the Foundatons of Math. North Holland, Amsterdam, 1969.
van Gasteren, A. J. M.:On The Shape of Mathematical Arguments, LNCS, 445. Springer, Berlin, 1990.
Wiltink, J. G.: A Deficiency of Natural Deduction.Inf. Process. Lett., 25, 233–234 (1987).
Weber, M., Simons, M., and Lafontaine, C.:The Generic Development Language Deva LNCS, 738, Springer, Berlin, 1993.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Back, R., Grundy, J. & von Wright, J. Structured calculational proof. Formal Aspects of Computing 9, 469–483 (1997). https://doi.org/10.1007/BF01211456
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01211456