Program construction and verification
Program construction and verification
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
The Science of Programming
A Discipline of Programming
Concrete Math
Program Construction: Calculating Implementations from Specifications
Program Construction: Calculating Implementations from Specifications
Calculating Invariants as Coreflexive Bisimulations
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Pointfree expression and calculation: from quantification to temporal logic
Formal Methods in System Design
Typed linear algebra for weigthed (probabilistic) automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
The Eindhoven quantifier notation is systematic, unlike standard mathematicial notation. This has the major advantage that calculations with quantified expressions become more straightforward because the calculational rules need be given just once for a great variety of different quantifiers. We demonstrate the ease of calculation with finite quantifications by considering a number of examples. Two are simple warm-up exercises, using boolean equality as the quantifier. Three are taken from books of challenging mathematical problems, and one is a problem concocted by the authors to demonstrate the techniques.