scientific article; zbMATH DE number 4078771

From MaRDI portal
Publication:3809237





[For the entire collection see Zbl 0653.00015.] Handling of errors has always been a challenge to the theory of abstract data types [\textit{J. B. Wright}, \textit{E. G. Wagner} and \textit{J. W. Thatcher}, Lect. Notes Comput. Sci. 53, 192-212 (1977; Zbl 0372.06002); \textit{J. A. Goguen}, Form. Descr. Program. Lang., Proc. IFIP Conf., St. Andrews/Canada 1977, 491-525 (1978; Zbl 0373.68024)]. Order sorted algebras so far provide the most suitable framework to deal with error. Some worries, however, still remain. This paper is yet another attempt to clarify the subject. Initial algebra semantics considers errors just as ordinary data and then spends some efforts to discriminate errors from correct data. I challenge this point of view and propose to conceive errors as exceptions or interrupts as in operating systems and to use a typing mechanism to define a precise interface. We introduce classified algebras as a formal basis for this intuition. The paper starts with a discussion of errors in two sections outlining the problems and suggesting a solution. A brief section then explains the structure of the subsequent parts.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3809237)