Some Underlying Ideas for Guarded Algebras

Magne Haveraaen

(University of Bergen and University of Wales Swansea)

Much work has been done in the last 20 years on the use of universal algebra to specify data types and programs. A recurring problem in this work has been that there are many cases where one may not want to specify precisely what will happen, either because one does not care or it is too early to make the final decision. One solution is to use partial algebras in these cases. In this paper we suggest an alternative solution using the concept of guarded algebras and sketch its connection to the work on partial algebras.

This is collaborative work Eric G. Wagner
Tuesday 7th October 1997, 14:30
Seminar Room 322
Department of Computer Science