## Abstract

We contrast using a notation extension with using a combination of notations. Specifically, we compare the use of an extended dialect of Z with a combination of Z and predicative programming notation for algorithm refinement and for reasoning about time and space constraints on systems. We discuss the difficulty of using extended notations versus using heterogeneous notations, and consider when we might prefer to extend or combine notations. We conclude that there exist situations where a heterogeneous notation can be more appropriate to use than an extended notation.

Original language | Undefined/Unknown |
---|---|

Pages | 214-232 |

Publication status | Published - 1998 |