On Calculational Proofs (1998) [2 citations — 0 self]
by
Vladimir Lifschitz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Lifschitz98oncalculational,
author = {Vladimir Lifschitz},
title = {On Calculational Proofs},
year = {1998}
}
author = {Vladimir Lifschitz},
title = {On Calculational Proofs},
year = {1998}
}
Bookmarks
OpenURL
Abstract:
This note is about the "calculational style" of presenting proofs introduced by Dijkstra and Scholten and adopted in some books on theoretical computer science. We define the concept of a calculation, which is a formal counterpart of the idea of a calculational proof. The definition is in terms of a new formalization DS of predicate logic.
Citations
| 404 | The Science of Programming – Gries - 1981 |
| 228 | Introduction to Mathematical Logic – Mendelson - 1997 |
| 200 | Predicate calculus and program semantics – Dijkstra, Scholten - 1990 |
| 96 | A Logical Approach to Discrete Math – Gries, Schneider - 1993 |
| 7 | Equational propositional logic – Gries, Schneider - 1995 |
| 2 | Short proofs of tautologies using the schema of equivalence – Baaz, Zach - 1994 |
| 1 | Predicate calculus: concepts and misconceptions’, Computing Science Reports 96-21 – Bijlsma, Nederpelt - 1996 |
