Non-strict don't care algebras and specifications

  • Egidio Astesiano
  • Maura Cerioli
CAAP Colloquium On Trees In Algebra And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 493)


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 straightforward 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.


  1. [AC1]
    Astesiano E.; Cerioli M. “On the Existence of Initial Models for Partial (Higher-Order) Conditional Specifications”, Proc. TAPSOFT'89, vol. 1, Lecture Notes in Computer Science n. 351, 1989.Google Scholar
  2. [AC2]
    Astesiano E.; Cerioli M. “Commuting between Institutions via Simulation” submitted for acceptance, also available as Technical Report n. 2, 1990, Formal Methods Group, University of Genoa (Italy).Google Scholar
  3. [AC3]
    Astesiano E.; Cerioli M. “Non-strict don't care algebras and specifications”, Technical Report n. 5, 1990, Formal Methods Group, University of Genoa (Italy).Google Scholar
  4. [B]
    Burmeister P. A Model Theoretic Oriented Approach to Partial Algebras, Akademie-Verlag Berlin, 1986.Google Scholar
  5. [Br]
    Broy M. Partial Interpretation of Higher-Order Algebraic Types, in Proc. of Mathematical foundations of Computer Science 1986, Lecture Notes in Computer Science n.233.Google Scholar
  6. [BW1]
    Broy M.; Wirsing M. “Partial abstract types”, Acta Informatica 18 (1982).Google Scholar
  7. [BW2]
    Broy M.; Wirsing M., “Generalized Heterogeneous Algebras and Partial Interpretations” Proc. CAAP'84, Lecture Notes in Computer Science n.159, 1984.Google Scholar
  8. [C]
    Cerioli M. “A sound and equationally-complete deduction system for partial conditional (higher order) types”, Proc 3rd Italian Conference of Theoretical Computer Science, World Scientific, 1989.Google Scholar
  9. [GB1]
    Goguen J.A.; Burstall R.M. “Introducing Institutions”. Logic of Programs, Lecture Notes in Computer Science n. 164, 1984.Google Scholar
  10. [GB2]
    Goguen J.A.; Burstall R.M. “Institutions: Abstract Model Theory for Specification and Programming”. Technical Report of Computer Science Laboratory, SRI International, 1990.Google Scholar
  11. [K]
    Keisler H.J. Model Theory for Infinitary Logic, North-Holland, 1971.Google Scholar
  12. [M]
    Meseguer J. “General logic”, in Proc. Logic Colloquium '87, H.-D. Ebbinghaus et al. (eds.), North-Holland, 1989Google Scholar
  13. [MG]
    Meseguer J.; Goguen J.A. “Initiality, Induction and Computability”, in Algebraic Methods in Semantics, Cambridge University Press, 1985.Google Scholar
  14. [MS]
    Manca V.; Salibra A “Equational Calculi for Many-sorted Algebras with Empty Carriers”, Proc. Mathematical Foundations of Computer Science 1990, Lecture Notes in Computer Science n.452, 1990.Google Scholar
  15. [P]
    Poigné A. “Partial Algebras, Subsorting, and Dependent Types”, Proc. 5th Workshop on Specification of Abstract Data Types, Gullane, Scotland September '87, Lecture Notes in Computer Science n. 332, 1988.Google Scholar
  16. [R]
    Reichel H. Initial Computability, Algebraic Specifications, and Partial Algebras, Akademie-Verlag, Berlin, 1986.Google Scholar
  17. [T]
    Tarlecki A. “Quasi-varieties in Abstract Algebraic Institutions”, Journal of Computer and System Science, n. 33, 1986.Google Scholar
  18. [W]
    Wirsing M. “Algebraic Specification” in Handbook of Theoretical Computer Science, vol.B, Elsevier, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Egidio Astesiano
    • 1
  • Maura Cerioli
    • 1
  1. 1.Dipartimento di MatematicaUniversità di GenovaGenovaItaly

Personalised recommendations