The inverse semigroup of a sum-ordered semiring (Q800396)

Computer scientists are interested in methods of transforming a program to a more perspicuous form without altering the computed function. There is a recognized need for an algebraic theory of program transformation [\textit{J. W. Backus}, Commun. ACM 21, 613-641 (1978; Zbl 0383.68013)]. Toward this end, it is well-known [the first author and \textit{M. A. Arbib}, Algebraic approaches to program semantics (to appear)] that a wide class of programs are described by an n-by-n matrix A and an n-by-1 matrix B whose entries are in the set Pfn(D,D) of all partial functions from a 'data set' D to itself. This paper initiates the study of sum- ordered semirings, ''ring-like'' ordered structures which abstract Pfn(D,D) and some of its cousins with the above motivation in mind.