Non-strict don't care functions, whose foremost representative is the ubiquitous if_then_else, play an essential role in computer science. As for what concerns semantics, they can be modelled by their totalizations with the appropriate use of elements representing undefinedness, as D. Scott has shown in his denotational approach. The situation is not so straighforward when we consider non-strict functions in the context of an algebraic framework. In this paper, after presenting the basic properties of the category of non-strict algebras, we explore the relationship between non-strict don't care and total algebras. Then the conditional algebraic specifications are investigated; it is shown that non-strict conditional specifications are equivalent to disjunctive specifications and necessary and sufficient conditions for the existence of initial models are given. Since non-strict don't care specifications generalize both the total and the partial case, it is shown how the results about initiality can be obtained as specializations.
CITATION STYLE
Astesiano, E., & Cerioli, M. (1991). Non-strict don’t care algebras and specifications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 493 LNCS, pp. 121–142). Springer Verlag. https://doi.org/10.1007/3-540-53982-4_8
Mendeley helps you to discover research relevant for your work.