Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-30T03:28:31.408Z Has data issue: false hasContentIssue false
  • English
  • Français

Non-strict don't care algebras and specifications†

Published online by Cambridge University Press:  04 March 2009

Egidio Astesiano  and
Maura Cerioli
Egidio Astesiano
Affiliation:
Dipartimento di Informatica e Scienze dell’Informazione, Via Dodecaneso 35, 16146 Genova (Italy) Email {astes, cerioli}@disi.unige.it
Maura Cerioli
Affiliation:
Dipartimento di Informatica e Scienze dell’Informazione, Via Dodecaneso 35, 16146 Genova (Italy) Email {astes, cerioli}@disi.unige.it
Get access Rights & Permissions [Opens in a new window]

Abstract

Non-strict don't care functions, whose foremost representative is the ubiquitous if_then_else, play an essential role in computer science. As far as the semantics is concerned, 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; this point is discussed in the last section, where we explore the relationship between non-strict don't care and total algebras. The central part of this paper, after presenting the basic properties of the category of non-strict algebras, is an investigation of conditional algebraic specifications. 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 for initiality can be obtained as specializations.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 6 , Issue 1 , February 1996 , pp. 85 - 125
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Astesiano, E. and Cerioli, M. (1989) On the existence of initial models for partial (higher-order) conditional specifications. In: Proceedings of TAPSOFT'89. Springer-Verlag Lecture Notes in Computer Science 351 74–88.Google Scholar
Astesiano, E. and Cerioli, M. (1990) Commuting between institutions via simulation. Technical Report FMG 2, Department of Mathematics, University of Genoa.Google Scholar
Astesiano, E. and Cerioli, M. (1993) Relationships between logical frames. In: Recent Trends in Data Type Specification. Springer-Verlag Lecture Notes in Computer Science 655 126–143.Google Scholar
Astesiano, E. and Cerioli, M. (1994) Multiparadigm specification languages: a first attempt at foundations. In: Andrews, D. J. and Groote, J. F. (eds.) Semantics of Specification Languages (SoSL'93), Workshops in Computing, Springer-Verlag 168–185.Google Scholar
Astesiano, E. and Cerioli, M. (1995) Free objects and equational deduction for partial conditional specifications. Theoretical Computer Science 152 (1) 91–138.CrossRefGoogle Scholar
Broy, M. (1986) Partial interpretation of higher-order algebraic types. In: Proceedings of Mathematical foundations of Computer Science 1986. Springer-Verlag Lecture Notes in Computer Science.Google Scholar
Broy, M. and Wirsing, M. (1982) Partial abstract types. Acta Informatica 18.Google Scholar
Broy, M. and Wirsing, M. (1984) Generalized heterogeneous algebras and partial interpretations. In: Proceedings of CAAP'83. Springer-Verlag Lecture Notes in Computer Science 159 1–34.Google Scholar
Burmeister, P. (1986) A Model Theoretic Oriented Approach to Partial Algebras, Akademie Verlag, Berlin.Google Scholar
Cerioli, M. (1989) A sound and equationally-complete deduction system for partial conditional (higher order) types. In: Proceedings of the 3rd Italian Conference of Theoretical Computer Science, World Scientific.Google Scholar
Cerioli, M. (1993) Relationships between Logical Formalisms, Ph.D. thesis, Universities of Genova, Pisa and Udine. (Available as internal report of Pisa University, TD-4/93.)Google Scholar
Goguen, J. and Burstall, R. (1984) Introducing institutions. In: Clarke, E. and Kozen, D. (eds.) Logics of Programs Workshop. Springer-Verlag Lecture Notes in Computer Science 164 221–256.Google Scholar
Keisler, H. (1971) Model Theory for Infinitary Logic, North-Holland, New York.Google Scholar
Manca, V. and Salibra, A. (1990) Equational calculi for many-sorted algebras with empty carriers. In: Proceedings of Mathematical Foundations of Computer Science 1990. Springer-Verlag Lecture Notes in Computer Science 452.Google Scholar
Meseguer, J. (1989) General logics. In: Logic Colloquium '87, North-Holland, Amsterdam275–329.Google Scholar
Meseguer, J. and Goguen, J. (1985). Initiality, induction and computability. In: Nivat, M. and Reynolds, J. (eds.) Algebraic Methods in Semantics, Cambridge459–540.Google Scholar
Poigné, A. (1987) Partial algebras, subsorting, and dependent types: Prerequisites of error handling in algebraic specifications. In: Recent Trends in Data Type Specification. Springer-Verlag Lecture Notes in Computer Science 332 208–234.Google Scholar
Reichel, H. (1986) Initial Computability, Algebraic Specifications, and Partial Algebras. Akademie Verlag, Berlin.Google Scholar
Tarlecki, A. (1986) Quasi-varieties in abstract algebraic institutions. Journal of Computer and System Science 33 333–360.Google Scholar